cur精品文章

• 

  Binary Tree Traversal

  ...s = new ArrayDeque(); List ans = new ArrayList(); TreeNode cur = root; while (cur != null || !s.isEmpty()) { while (cur != null) { s.pus...

  浠ラ箍 2019-08-14 17:17 評論0 收藏0
• 

  JS中的二叉樹遍歷

  ...楚。按照代碼走一邊你就懂了。（認(rèn)真臉） var preOrderUnRecur = function(node) { if(!node) { throw new Error(Empty Tree) } var stack = [] stack.push(node) while(stack.length !== 0) { node = stack.pop()...

  ghnor 2019-08-19 17:52 評論0 收藏0
• 

  Inorder Preorder Postorder

  ...Tree Inorder Traversal lc題目鏈接：https://leetcode.com/problems... recursion： public class Solution { public List inorderTraversal(TreeNode root) { List result = new ArrayList(); df...

  caikeal 2019-08-14 17:23 評論0 收藏0
• 

  LeetCode 138：復(fù)制帶隨機(jī)指針的鏈表 Copy List with Random Poin

  ...hashMap Node newHead = new Node(0);//虛擬頭節(jié)點(diǎn) Node cur = newHead;//指針指向當(dāng)前節(jié)點(diǎn) Node tmp; while (head != null) { if (map.containsKey(head)) {//查詢原節(jié)點(diǎn)是否已存在于map ...

  entner 2019-08-19 10:13 評論0 收藏0
• 

  LeetCode 138：復(fù)制帶隨機(jī)指針的鏈表 Copy List with Random Poin

  ...hashMap Node newHead = new Node(0);//虛擬頭節(jié)點(diǎn) Node cur = newHead;//指針指向當(dāng)前節(jié)點(diǎn) Node tmp; while (head != null) { if (map.containsKey(head)) {//查詢原節(jié)點(diǎn)是否已存在于map ...

  Lucky_Boy 2019-07-31 11:31 評論0 收藏0
• 

  [LeetCode] 282. Expression Add Operators

  ...!= index && num.charAt(index) == 0) break; long cur = Long.parseLong(num.substring(index, i+1)); if (index == 0) { dfs(num, temp+cur, i+1, targe...

  wangjuntytl 2019-08-16 13:48 評論0 收藏0
• 

  我的面試準(zhǔn)備過程--二叉樹(更新中)

  ...tack(); stack.push(root); while(!stack.empty()){ TreeNode cur = stack.pop(); System.out.println(cur.val); //后入先出，因而先壓右結(jié)點(diǎn)，再壓左結(jié)點(diǎn) if(null != cur.right){ ...

  Amio 2019-08-16 10:36 評論0 收藏0
• 

  【刷算法】兩種類型的刪除有序鏈表中的重復(fù)節(jié)點(diǎn)

  ... var H = new ListNode(null); H.next = pHead; var pre = H; var cur = pHead; while(cur !== null && cur.next !== null) { if(cur.next.val === cur.val){ var curRepe...

  googollee 2019-08-22 18:07 評論0 收藏0