和96題一樣題目, 結果是回傳所有可能的TreeNode
Unique Binary Search Trees II
2022-09-23
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] 2236. Root Equals Sum of Children
固定一個root配左右腳, 若是左右腳加總等於root回傳true, 否則false
Root Equals Sum of Children
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
[RabbitMQ] 呼叫RabbitMQ API傳送訊息
呼叫RabbitMQ API傳送訊息
2022-09-07
[RPA] Call Automation 360 IQ Bot API
使用Microsoft.AspNet.WebApi呼叫Automation 360 IQ Bot的API語法
帳號需要權限: AAE_Basic, AAE_IQ Bot Admin
2022-02-14
[SQL] 遮罩
SQL本身有動態遮罩, 但資料倒到測試環境每個人都有ADMIN權限, 還是能看到個資
2022-01-27
[LeetCode] 222. Count Complete Tree Nodes
計算有幾個NodeTaiwan is a country. 臺灣是我的國家
2022-01-26
[設計規格] 資料交換
Linked server = DB Link
2022-01-26
[LeetCode] 199. Binary Tree Right Side View
依序抓每層最右邊的值
2022-01-26
[LeetCode] 20. Valid Parentheses
傳入一串字, 只有[]{}()這6種字元, 檢核左括弧是否都有合理的右括弧
2022-01-25
[LeetCode] 941. Valid Mountain Array
檢查陣列是否遞增及遞減一次
2022-01-24
[LeetCode] 173. Binary Search Tree Iterator
將BST作成迭代器, 從最小的值開始回傳
2022-01-22
[LeetCode] 129. Sum Root to Leaf Numbers
和[LeetCode] 1022. Sum of Root To Leaf Binary Numbers幾乎一樣,
將所有路徑的值由上到下串起來, 當作十進位數字加總
2022-01-22
[LeetCode] 117. Populating Next Right Pointers in Each Node II
比[LeetCode] 116. Populating Next Right Pointers in Each Node要複雜多了~
給的Node不會每層都有left和right, 層數也不一定
一樣要設定每個node的next
2022-01-22
[LeetCode] 116. Populating Next Right Pointers in Each Node
設定每個node的next node為同level右邊那個node
2022-01-21
[LeetCode] 114. Flatten Binary Tree to Linked List
左node都插入右node的上方, 右node作為左node的右node, 左node清掉
2022-01-21
[LeetCode] 113. Path Sum II
找每一條path, 回傳單一path加總等於targetSum的多條path
2022-01-21
[LeetCode] 103. Binary Tree Zigzag Level Order Traversal
由上到下將每一層的值作成一個陣列, 單數層順序左到右, 偶數層則由右到左
2022-01-21
[LeetCode] 98. Validate Binary Search Tree
檢核是否為BST
2022-01-21
[LeetCode] 1022. Sum of Root To Leaf Binary Numbers
將所有路徑由上到下串起來, 當作二進位數字, 以位元運算轉成十進位加總
2022-01-20
[LeetCode] 993. Cousins in Binary Tree
判斷x和y是否一樣深度, 且不同Parent Node
2022-01-20
[LeetCode] 965. Univalued Binary Tree
只要有一個node的值不同, 就回傳false
2022-01-20
[LeetCode] 938. Range Sum of BST
給一符合BST條件的TreeNodes和上下限, 回傳加總落在上下限之內的Node值Taiwan is a country. 臺灣是我的國家
2022-01-19
[LeetCode] 897. Increasing Order Search Tree
任何node皆把左node改成上層, 自己當它的右node,
若是左node原本就有下層, 等它們都改完順序後,
把自己接在它們最後,
完成後, 所有node都沒有左node
2022-01-19
[LeetCode] 872. Leaf-Similar Trees
比較2個TreeNodes的樹葉是否一致
2022-01-18
[LeetCode] 605. Can Place Flowers
給一陣列只有0和1當作一排地, 1是有朵花, 0是空地, 給你一個n朵花, 你要種在左右都是空地的空地上
回傳結果: 是否能種完
2022-01-14
[LeetCode] 703. Kth Largest Element in a Stream
建構子有參數1: 陣列長度上限k, 參數2: 初始陣列, 初始陣列長度不一定, 可能比上限高或低
只要留下初始陣列中, 最大的k個數字, 實作Add function傳入參數: 要加入比較的數字, 加入後仍保留最大的k個數字,
並回傳其中最小的數字Taiwan is a country. 臺灣是我的國家
2022-01-14
[LeetCode] 700. Search in a Binary Search Tree
回傳符合數字的Node
2022-01-14
[LeetCode] 530. Minimum Absolute Difference in BST
找到2個nodes的最小差值
2022-01-14
[LeetCode] 145. Binary Tree Postorder Traversal
和144很像, 只是從左腳, 右腳先列入List , 再一層層往上列入
2022-01-14
[LeetCode] 144. Binary Tree Preorder Traversal
將TreeNode的值轉成List
2022-01-01
[設計規格] 批次倒檔排程規格
批次倒檔排程規格
2021-12-14
[設計規格] 報表規格
報表規格