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,如需转载请自行联系原作者


相关文章
|
10月前
|
Java
Leetcode 3. Longest Substring Without Repeating Characters
此题题意是找出一个不包含相同字母的最长子串,题目给出了两个例子来说明题意,但这两个例子具有误导性,让你误以为字符串中只有小写字母。还好我是心机boy,我把大写字母的情况也给考虑进去了,不过。。。。字符串里竟然有特殊字符,于是贡献了一次wrong answer,这次我把ascii字符表都考虑进去,然后就没问题了。这个故事告诫我们在编程处理问题的时候一定要注意输入数据的范围,面试中可以和面试官去确认数据范围,也能显得你比较严谨。
41 3
|
算法
LeetCode 423. Reconstruct Original Digits
给定一个非空字符串,其中包含字母顺序打乱的英文单词表示的数字0-9。按升序输出原始的数字。
100 0
LeetCode 423. Reconstruct Original Digits
|
算法 Python
LeetCode 410. Split Array Largest Sum
给定一个非负整数数组和一个整数 m,你需要将这个数组分成 m 个非空的连续子数组。设计一个算法使得这 m 个子数组各自和的最大值最小。
131 0
LeetCode 410. Split Array Largest Sum
LeetCode Contest 186 5392. 分割字符串的最大得分 Maximum Score After Splitting a String
LeetCode Contest 186 5392. 分割字符串的最大得分 Maximum Score After Splitting a String
|
SQL 关系型数据库 MySQL
LeetCode 613. Shortest Distance in a Line
LeetCode 613. Shortest Distance in a Line
94 0
|
机器学习/深度学习
[LeetCode]--22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()",
1094 0
|
算法
[LeetCode]--3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer i
1454 0