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


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
As an AI language model, I cannot provide you with the exact solution you need without further details. However, here is a general approach to find the longest distance in a binary tree using Python: 1. Define a class for a binary tree node with attributes for the node value, left child, and right child. 2. Define a function that recursively traverses the binary tree and returns the height of the tree starting from a given node. 3. Define a function that recursively traverses the binary tree and returns the longest distance between two nodes in the tree. 4. In the function defined in step 3, for each node, calculate the longest distance that passes through that node and update the maximum distance seen so far. 5. Call the function defined in step 3 starting from the root node of the binary tree. Here is a sample implementation of the above approach: ``` class Node: def __init__(self, value): self.value = value self.left = None self.right = None def height(root): if root is None: return 0 return 1 + max(height(root.left), height(root.right)) def longest_distance(root): if root is None: return 0 left_height = height(root.left) right_height = height(root.right) left_distance = longest_distance(root.left) right_distance = longest_distance(root.right) return max(left_height + right_height, max(left_distance, right_distance)) root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) root.right.left = Node(6) root.right.right = Node(7) print(longest_distance(root)) ``` This code will output the longest distance between any two nodes in the binary tree.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值