mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Merge branch 'youngyangyang04:master' into master
This commit is contained in:
@ -355,8 +355,8 @@ class Solution:
|
||||
while left <= right:
|
||||
middle = left + (right-left) // 2
|
||||
if nums[middle] >= target: # 寻找左边界,nums[middle] == target的时候更新right
|
||||
right = middle - 1;
|
||||
leftBoder = right;
|
||||
right = middle - 1
|
||||
leftBoder = right
|
||||
else:
|
||||
left = middle + 1
|
||||
return leftBoder
|
||||
|
@ -155,14 +155,14 @@ public:
|
||||
以上代码精简之后如下:
|
||||
|
||||
```cpp
|
||||
class solution {
|
||||
class Solution {
|
||||
public:
|
||||
bool hasPathSum(TreeNode* root, int sum) {
|
||||
if (root == null) return false;
|
||||
if (!root) return false;
|
||||
if (!root->left && !root->right && sum == root->val) {
|
||||
return true;
|
||||
}
|
||||
return haspathsum(root->left, sum - root->val) || haspathsum(root->right, sum - root->val);
|
||||
return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
|
||||
}
|
||||
};
|
||||
```
|
||||
|
@ -628,6 +628,43 @@ impl Solution {
|
||||
}
|
||||
}
|
||||
```
|
||||
C#:
|
||||
三指针法, 感觉会更直观:
|
||||
|
||||
```cs
|
||||
public LinkNumbers Reverse()
|
||||
{
|
||||
///用三指针,写的过程中能够弥补二指针在翻转过程中的想象
|
||||
LinkNumbers pre = null;
|
||||
var move = root;
|
||||
var next = root;
|
||||
|
||||
while (next != null)
|
||||
{
|
||||
next = next.linknext;
|
||||
move.linknext = pre;
|
||||
pre = move;
|
||||
move = next;
|
||||
}
|
||||
root = pre;
|
||||
return root;
|
||||
}
|
||||
|
||||
///LinkNumbers的定义
|
||||
public class LinkNumbers
|
||||
{
|
||||
/// <summary>
|
||||
/// 链表值
|
||||
/// </summary>
|
||||
public int value { get; set; }
|
||||
|
||||
/// <summary>
|
||||
/// 链表指针
|
||||
/// </summary>
|
||||
public LinkNumbers linknext { get; set; }
|
||||
}
|
||||
```
|
||||
|
||||
<p align="center">
|
||||
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
|
||||
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
||||
|
@ -2,7 +2,7 @@
|
||||
|
||||
本周赶上了十一国庆,估计大家已经对本周末没什么概念了,但是我们该做总结还是要做总结的。
|
||||
|
||||
本周的主题其实是**简单但并不简单**,本周所选的题目大多是看一下就会的题目,但是大家看完本周的文章估计也发现了,二叉树的简答题目其实里面都藏了很多细节。 这些细节我都给大家展现了出来。
|
||||
本周的主题其实是**简单但并不简单**,本周所选的题目大多是看一下就会的题目,但是大家看完本周的文章估计也发现了,二叉树的简单题目其实里面都藏了很多细节。 这些细节我都给大家展现了出来。
|
||||
|
||||
|
||||
## 周一
|
||||
|
Reference in New Issue
Block a user