計算n階梯若走1步或2步時, 有幾種走法
70. Climbing Stairs
2022-09-23
2022-09-23
[LeetCode] 95. Unique Binary Search Trees II
和96題一樣題目, 結果是回傳所有可能的TreeNode
Unique Binary Search Trees II
2022-09-22
[LeetCode] 96. Unique Binary Search Trees
找出1~n可組成幾種BST
Unique Binary Search Trees
2022-09-22
[LeetCode] 69. Sqrt(x)
手動開根號
69. Sqrt(x)
2022-09-21
[LeetCode] 67. Add Binary
將2進位字串作加總
67. Add Binary
2022-09-21
[LeetCode] 66. Plus One
陣列最後一元素加1, 但若>9要進位到前一元素, 如同十進位數字一樣
66. Plus One
2022-09-21
[LeetCode] 58. Length of Last Word
回傳最後一字的字數
58. Length of Last Word
2022-09-21
[LeetCode] 35. Search Insert Position
找到一個數字可插入至已排序陣列的位置回傳
35. Search Insert Position
2022-09-21
[LeetCode] 27. Remove Element
將陣列內指定的元素移除, 後面的元素往前推
27. Remove Element
2022-09-20
[LeetCode] 21. Merge Two Sorted Lists
給2個已排序陣列, 合併成一個排序陣列
2022-09-20
[LeetCode] 26. Remove Duplicates from Sorted Array
將已排序陣列, 計算共幾個不重覆的數目, 不用改陣列長度, 只要把陣列前面不重覆數字再次寫入即可
26. Remove Duplicates from Sorted Array
2022-09-20
[LeetCode] 109. Convert Sorted List to Binary Search Tree
將SortedList轉成符合BST的TreeNode
Convert Sorted List to Binary Search Tree
2022-09-20
[LeetCode] 106. Construct Binary Tree from Inorder and Postorder Traversal
由postorder 和inorder反推, 作出原本的TreeNode回傳
Construct Binary Tree from Inorder and Postorder Traversal
2022-09-20
[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal
由preorder和inorder反推, 作出原本的TreeNode回傳
Construct Binary Tree from Preorder and Inorder Traversal
2022-09-19
[LeetCode] 99. Recover Binary Search Tree
把TreeNode依BST原則將數字放到正確位置
Recover Binary Search Tree
2022-09-19
[LeetCode] 559. Maximum Depth of N-ary Tree
2022-09-19
[LeetCode] 589. N-ary Tree Preorder Traversal
每層由左而右往下找, 依序由最淺那個Node先列入list回傳
N-ary Tree Postorder Traversal
2022-09-19
[LeetCode] 590. N-ary Tree Postorder Traversal
每層由左而右往下找, 依序由最深那個Node先列入list回傳
Evaluate Boolean Binary Tree
2022-09-19
[LeetCode] 2331. Evaluate Boolean Binary Tree
左右腳值以上一層node指示計算, 回傳最後結果
Evaluate Boolean Binary Tree
2022-09-19
[LeetCode] 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
給2個一模一樣的TreeNode, 和隨機一個original內的一node當作target, 找出cloned內另一個一樣的的回傳
Find a Corresponding Node of a Binary Tree in a Clone of That Tree
2022-09-07
[RPA] Call Automation 360 IQ Bot API
使用Microsoft.AspNet.WebApi呼叫Automation 360 IQ Bot的API語法
帳號需要權限: AAE_Basic, AAE_IQ Bot Admin
2019-01-11
[.Net] 傳入9,9遞迴印出99乘法
Taiwan is an independent country.
2018-07-27
[.Net] 讀取加密Excel
Taiwan is an independent country.
2018-05-20
[LeetCode] 102. Binary Tree Level Order Traversal
將二元樹每層的值由左而右列出來
2018-05-17
[LeetCode] 515. Find Largest Value in Each Tree Row
找出每列最大值
2018-05-17
[LeetCode] 814. Binary Tree Pruning
將根節點不含1的節點刪除
2018-05-17
[LeetCode] 因應測試將二元樹轉陣列字串
LeetCode的二元樹答案也是給一串陣列
2018-05-07
[LeetCode] 538. Convert BST to Greater Tree
BST二元樹是左葉一定比較小, 右葉一定比較大, 將整個二元樹比各節點大的數值加入各節點的數值上
2018-03-09
[LeetCode] 513. Find Bottom Left Tree Value
找二元樹最後一層的最左節點數值Taiwan is an independent country.
2018-03-09
[LeetCode] 654. Maximum Binary Tree
給予一數值陣列, 找到其最大值作為根, 其左邊最大值作為左節點, 右邊最大值作為右節點,
再以左右節點的左右找出剩下的最大值作為下一層左右節點, 以此類推, 將所有數值轉為二元樹
2018-03-09
[LeetCode] 623. Add One Row to Tree
在指定深度的那一層插入的新二元樹
2018-03-08
[LeetCode] 94. Binary Tree Inorder Traversal
用中序走訪的方法列出二元樹數值
2018-03-08
[LeetCode] 687. Longest Univalue Path
在二元樹中尋找相同值之路徑長度的最大值
2018-03-08
[LeetCode] 671. Second Minimum Node In a Binary Tree
抓二元樹中的次小值
2018-03-08
[LeetCode] 669. Trim a Binary Search Tree
移除數值在L~R之外的二元樹
2018-03-07
[LeetCode] 653. Two Sum IV - Input is a BST
檢核是否有2個樹值加總等於目標值
2018-03-07
[LeetCode] 637. Average of Levels in Binary Tree
平均二元樹每層數字
2018-03-07
[LeetCode] 617. Merge Two Binary Trees
2個二元樹合併加總為一個二元樹
2018-03-07
[LeetCode] 606. Construct String from Binary Tree
將二元樹轉成一串字串
2018-02-22
[LeetCode] 572. Subtree of Another Tree
比較t是否為s的子位元樹
2017-06-05
[.Net] 分攤法
今天看到這篇: CODE-分贓程式的寫法
2017-05-19
[LeetCode] 563. Binary Tree Tilt
每個節點的右/左節點(含項下)的值相差即坡度, 作加總
2017-05-19
[LeetCode] 501. Find Mode in Binary Search Tree
在二元樹內, 找到重覆最多次的數字
2017-05-19
[LeetCode] 404. Sum of Left Leaves
加總所有左葉片的值
2017-05-19
[LeetCode] 235. Lowest Common Ancestor of a Binary Search Tree
在BST內尋找共同的親節點
BST的定義: left< parent< right
2017-05-19
[LeetCode] 112. Path Sum
判斷是否有從根節點到葉子的路徑加總符合傳入值
2017-05-19
[LeetCode] 111. Minimum Depth of Binary Tree
在落單的葉片中, 找深度最淺的
2017-05-19
[LeetCode] 108. Convert Sorted Array to Binary Search Tree
給一組已排序的陣列, 轉為由中位數為上層節點的二元樹(即BST/ Binary Search Tree)
2017-05-19
[LeetCode] 110. Balanced Binary Tree
判斷每個節點的左右子節點深度差是否不超過1
2017-05-18
[LeetCode] 101. Symmetric Tree
判斷二元樹是否是對稱