algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新0116.填充每个节点的下一个右侧节点指针java注释及代码规范

Browse Source
This commit is contained in:
ironartisan
2021-08-11 20:13:02 +08:00
parent 44af8bd066
commit b02e144d7a
1 changed files with 13 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/0116.填充每个节点的下一个右侧节点指针.md
View File

@ -134,13 +134,13 @@ public:
class Solution { class Solution {
public void traversal(Node cur) { public void traversal(Node cur) {
if (cur == null) return; if (cur == null) return;
if(cur.left != null) cur.left.next = cur.right; if (cur.left != null) cur.left.next = cur.right; // 操作1
if (cur.right != null) { if (cur.right != null) {
if(cur.next != null) cur.right.next = cur.next.left; if(cur.next != null) cur.right.next = cur.next.left; //操作2
else cur.right.next = null; else cur.right.next = null;
} }
traversal(cur.left); traversal(cur.left); // 左
traversal(cur.right); traversal(cur.right); //右
} }
public Node connect(Node root) { public Node connect(Node root) {
traversal(root); traversal(root);