开发者社区> 技术小胖子> 正文
阿里云
为了无法计算的价值
打开APP
阿里云APP内打开

The Longest Distance in the World

简介:
+关注继续查看
The longest Distance in the World
The furthest distance in the world
Is not between life and death
But when I stand in front of you
Yet you don't know that I love you
 
The furthest distance in the word
Is not when I stand in front of you
Yet you can't see my love
But when undoubtedly knowing the love from both
Yet can not be together
 
The furthest distance in the word
Is not being apart while being in love
But when plainly can not resist the yearning
Yet pretending you have never been in my heart
 
The furthest distance in the world
Is not but using one's in different hear
To dig a uncrossable river
For the one who loves you
 
The furthest distance in the world
Is not being rude to my baby
But whe it is so plainly heartache and hopeless with our love
Yet there isn't any way to repair its heart
 
The furthest distance in the world
Is not distance or anything
But the hearts that were ever closed so firmly and smitten with each other
Yet have to be apart without any choice
My baby I am so sorry to hurt you
                                                                             From Duan's The Moving Heart
                                                                                 and I had motified a little
 
 



     本文转自 gaochaojs 51CTO博客,原文链接:http://blog.51cto.com/jncumter/262640,如需转载请自行联系原作者


版权声明:本文内容由阿里云实名注册用户自发贡献,版权归原作者所有,阿里云开发者社区不拥有其著作权,亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容,填写侵权投诉表单进行举报,一经查实,本社区将立刻删除涉嫌侵权内容。

相关文章
LeetCode 153. Find Minimum in Rotated Sorted Array
假设按照升序排序的数组在预先未知的某个点上进行了旋转。 ( 例如,数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。 请找出其中最小的元素。 你可以假设数组中不存在重复元素。
0 0
LeetCode Find Minimum in Rotated Sorted Array II
假设按照升序排序的数组在预先未知的某个点上进行了旋转。 ( 例如,数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。 请找出其中最小的元素。 注意数组中可能存在重复的元素。
0 0
LeetCode 613. Shortest Distance in a Line
LeetCode 613. Shortest Distance in a Line
0 0
[LeetCode] Find Minimum in Rotated Sorted Array
As explained in the Solution tag, the key to solving this problem is to use invariants. We set two pointers: l for the left and r for the right.
447 0
[LeetCode] Find Minimum in Rotated Sorted Array II
This problem is more or less the same as Find Minimum in Rotated Sorted Array. And one key difference is as stated in the solution tag.
448 0
[LeetCode] Max Points on a Line
This problem has a naive idea, which is to traverse all possible pairs of two points and see how many other points fall in the line determined by them.
415 0
[LeetCode] Find Minimum in Rotated Sorted Array II
Follow up for “Find Minimum in Rotated Sorted Array”: What if duplicates are allowed? Would this affect the run-time complexity? How and why? Suppose a sorted array is rotated at some pi
860 0
文章
问答
文章排行榜
最热
最新
相关电子书
更多
Constrained Output Embeddings for End-to-End Code-Switching Speech Recognition with Only Monolingual Data
立即下载
低代码开发师(初级)实战教程
立即下载
阿里巴巴DevOps 最佳实践手册
立即下载