kflili
diff --git a/‎LeetcodeCShaprDotNetCore/Solution.cs
Lines changed: 10 additions & 15 deletions b/‎LeetcodeCShaprDotNetCore/Solution.cs
Lines changed: 10 additions & 15 deletions
diff --git a/‎README.md
Lines changed: 2 additions & 1 deletion b/‎README.md
Lines changed: 2 additions & 1 deletion
diff --git a/‎Algorithms Basics/top-interview-questions/108. Convert Sorted Array to Binary Search Tree.cs renamed to ‎top-interview-questions/108. Convert Sorted Array to Binary Search Tree.cs b/‎Algorithms Basics/top-interview-questions/108. Convert Sorted Array to Binary Search Tree.cs renamed to ‎top-interview-questions/108. Convert Sorted Array to Binary Search Tree.cs
diff --git a/‎Algorithms Basics/top-interview-questions/118. Pascal's Triangle.cs renamed to ‎top-interview-questions/118. Pascal's Triangle.cs b/‎Algorithms Basics/top-interview-questions/118. Pascal's Triangle.cs renamed to ‎top-interview-questions/118. Pascal's Triangle.cs
diff --git a/‎Algorithms Basics/top-interview-questions/121. Best Time to Buy and Sell Stock.cs renamed to ‎top-interview-questions/121. Best Time to Buy and Sell Stock.cs b/‎Algorithms Basics/top-interview-questions/121. Best Time to Buy and Sell Stock.cs renamed to ‎top-interview-questions/121. Best Time to Buy and Sell Stock.cs
diff --git a/‎Algorithms Basics/top-interview-questions/122. Best Time to Buy and Sell Stock II.cs renamed to ‎top-interview-questions/122. Best Time to Buy and Sell Stock II.cs b/‎Algorithms Basics/top-interview-questions/122. Best Time to Buy and Sell Stock II.cs renamed to ‎top-interview-questions/122. Best Time to Buy and Sell Stock II.cs
diff --git a/‎Algorithms Basics/top-interview-questions/14. Longest Common Prefix.cs renamed to ‎top-interview-questions/14. Longest Common Prefix.cs b/‎Algorithms Basics/top-interview-questions/14. Longest Common Prefix.cs renamed to ‎top-interview-questions/14. Longest Common Prefix.cs
diff --git a/‎Algorithms Basics/top-interview-questions/155. Min Stack.cs renamed to ‎top-interview-questions/155. Min Stack.cs b/‎Algorithms Basics/top-interview-questions/155. Min Stack.cs renamed to ‎top-interview-questions/155. Min Stack.cs
diff --git a/‎Algorithms Basics/top-interview-questions/160. Intersection of Two Linked Lists.cs renamed to ‎top-interview-questions/160. Intersection of Two Linked Lists.cs b/‎Algorithms Basics/top-interview-questions/160. Intersection of Two Linked Lists.cs renamed to ‎top-interview-questions/160. Intersection of Two Linked Lists.cs
diff --git a/‎Algorithms Basics/top-interview-questions/169. Majority Element.cs renamed to ‎top-interview-questions/169. Majority Element.cs b/‎Algorithms Basics/top-interview-questions/169. Majority Element.cs renamed to ‎top-interview-questions/169. Majority Element.cs
diff --git a/‎Algorithms Basics/top-interview-questions/171. Excel Sheet Column Number.cs renamed to ‎top-interview-questions/171. Excel Sheet Column Number.cs b/‎Algorithms Basics/top-interview-questions/171. Excel Sheet Column Number.cs renamed to ‎top-interview-questions/171. Excel Sheet Column Number.cs
diff --git a/‎Algorithms Basics/top-interview-questions/172. Factorial Trailing Zeroes.cs renamed to ‎top-interview-questions/172. Factorial Trailing Zeroes.cs b/‎Algorithms Basics/top-interview-questions/172. Factorial Trailing Zeroes.cs renamed to ‎top-interview-questions/172. Factorial Trailing Zeroes.cs
diff --git a/‎Algorithms Basics/top-interview-questions/189. Rotate Array.cs renamed to ‎top-interview-questions/189. Rotate Array.cs b/‎Algorithms Basics/top-interview-questions/189. Rotate Array.cs renamed to ‎top-interview-questions/189. Rotate Array.cs
diff --git a/‎Algorithms Basics/top-interview-questions/198. House Robber.cs renamed to ‎top-interview-questions/198. House Robber.cs b/‎Algorithms Basics/top-interview-questions/198. House Robber.cs renamed to ‎top-interview-questions/198. House Robber.cs
diff --git a/‎Algorithms Basics/top-interview-questions/202. Happy Number.cs renamed to ‎top-interview-questions/202. Happy Number.cs b/‎Algorithms Basics/top-interview-questions/202. Happy Number.cs renamed to ‎top-interview-questions/202. Happy Number.cs
diff --git a/‎Algorithms Basics/top-interview-questions/204. Count Primes.cs renamed to ‎top-interview-questions/204. Count Primes.cs b/‎Algorithms Basics/top-interview-questions/204. Count Primes.cs renamed to ‎top-interview-questions/204. Count Primes.cs
diff --git a/‎Algorithms Basics/top-interview-questions/217. Contains Duplicate.cs renamed to ‎top-interview-questions/217. Contains Duplicate.cs b/‎Algorithms Basics/top-interview-questions/217. Contains Duplicate.cs renamed to ‎top-interview-questions/217. Contains Duplicate.cs
diff --git a/‎Algorithms Basics/top-interview-questions/219. Contains Duplicate II.cs renamed to ‎top-interview-questions/219. Contains Duplicate II.cs b/‎Algorithms Basics/top-interview-questions/219. Contains Duplicate II.cs renamed to ‎top-interview-questions/219. Contains Duplicate II.cs
diff --git a/‎Algorithms Basics/top-interview-questions/268. Missing Number.cs renamed to ‎top-interview-questions/268. Missing Number.cs b/‎Algorithms Basics/top-interview-questions/268. Missing Number.cs renamed to ‎top-interview-questions/268. Missing Number.cs
diff --git a/‎Algorithms Basics/top-interview-questions/344. Reverse String.cs renamed to ‎top-interview-questions/344. Reverse String.cs b/‎Algorithms Basics/top-interview-questions/344. Reverse String.cs renamed to ‎top-interview-questions/344. Reverse String.cs
diff --git a/‎Algorithms Basics/top-interview-questions/349. Intersection of Two Arrays.cs renamed to ‎top-interview-questions/349. Intersection of Two Arrays.cs b/‎Algorithms Basics/top-interview-questions/349. Intersection of Two Arrays.cs renamed to ‎top-interview-questions/349. Intersection of Two Arrays.cs
diff --git a/‎Algorithms Basics/top-interview-questions/350. Intersection of Two Arrays II.cs renamed to ‎top-interview-questions/350. Intersection of Two Arrays II.cs b/‎Algorithms Basics/top-interview-questions/350. Intersection of Two Arrays II.cs renamed to ‎top-interview-questions/350. Intersection of Two Arrays II.cs
diff --git a/‎Algorithms Basics/top-interview-questions/371. Sum of Two Integers.cs renamed to ‎top-interview-questions/371. Sum of Two Integers.cs b/‎Algorithms Basics/top-interview-questions/371. Sum of Two Integers.cs renamed to ‎top-interview-questions/371. Sum of Two Integers.cs
diff --git a/‎Algorithms Basics/top-interview-questions/38. Count and Say.cs renamed to ‎top-interview-questions/38. Count and Say.cs b/‎Algorithms Basics/top-interview-questions/38. Count and Say.cs renamed to ‎top-interview-questions/38. Count and Say.cs
diff --git a/‎Algorithms Basics/top-interview-questions/387. First Unique Character in a String.cs renamed to ‎top-interview-questions/387. First Unique Character in a String.cs b/‎Algorithms Basics/top-interview-questions/387. First Unique Character in a String.cs renamed to ‎top-interview-questions/387. First Unique Character in a String.cs
diff --git a/‎Algorithms Basics/top-interview-questions/412. Fizz Buzz.cs renamed to ‎top-interview-questions/412. Fizz Buzz.cs b/‎Algorithms Basics/top-interview-questions/412. Fizz Buzz.cs renamed to ‎top-interview-questions/412. Fizz Buzz.cs
diff --git a/‎Algorithms Basics/top-interview-questions/53. Maximum Subarray.cs renamed to ‎top-interview-questions/53. Maximum Subarray.cs b/‎Algorithms Basics/top-interview-questions/53. Maximum Subarray.cs renamed to ‎top-interview-questions/53. Maximum Subarray.cs
@@ -5,21 +5,16 @@
 
 namespace LeetcodeCShaprDotNetCore {
     public class Solution {
-        public IList<IList<int>> Generate(int numRows) {
-            IList<IList<int>> result = new List<IList<int>>();
-            for (int row = 0; row < numRows; row++) {
-                IList<int> list = new List<int>();
-                for (int i = 0; i < row + 1; i++) {
-                    if (i == 0 || i == row) {
-                        list.Add(1);
-                    } else {
-                        var preList = result[row - 1];
-                        list.Add(preList[i - 1] + preList[i]);
-                    }
-                }
-                result.Add(list);
-            }
-            return result;
+        public TreeNode SortedArrayToBST(int[] nums) {
+            return SortedArrayToBST(nums, 0, nums.Length - 1);
+        }
+        private TreeNode SortedArrayToBST(int[] nums, int left, int right) {
+            if (nums == null || nums.Length == 0 || left > right) return null;
+            int mid = left + (right - left) / 2;
+            TreeNode root = new TreeNode(nums[mid]);
+            root.left = SortedArrayToBST(nums, left, mid - 1);
+            root.right = SortedArrayToBST(nums, mid + 1, right);
+            return root;
         }
     }
 }
@@ -3,7 +3,7 @@
 I will use this repository to make notes for leetcode solutions and classify the problems by different topics.
 
 ## Solved Problem List
-Total solved: 71
+Total solved: 72
 
 ### top-interview-questions
 
@@ -12,6 +12,7 @@ ID | Difficulty | Tags | Solution
 14 | Easy | String | [Longest Common Prefix](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/14.%20Longest%20Common%20Prefix.cs)
 38 | Easy | String | [Count and Say](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/38.%20Count%20and%20Say.cs)
 53 | Easy | Dynamic Programming, Divide and Conquer | [Maximum Subarray](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/53.%20Maximum%20Subarray.cs)
+108 | Easy | Tree, DFS | [Convert Sorted Array to Binary Search Tree](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.cs)
 118 | Easy | Array, Math | [Pascal's Triangle](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/118.%20Pascal's%20Triangle.cs)
 121 | Easy | Array, Dynamic Programming | [Best Time to Buy and Sell Stock](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.cs)
 122 | Easy | Array | [Best Time to Buy and Sell Stock II](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.cs)