Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
@CharleneJiang
CharleneJiang authored Jul 20, 2016
1 parent 6523da7 commit a60f83b
Showing 1 changed file with 83 additions and 83 deletions.
166 changes: 83 additions & 83 deletions README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -441,89 +441,89 @@
| [Swift](./Math/HappyNumber.swift) | 202 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy |
| | 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | Medium |
| [Swift](./DFS/NumberofIslands.swift) | 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium |
| | 199 | Binary Tree Right Side View | Medium |
| [Swift](./DP/HouseRobber.swift) | 198 | House Robber | Easy |
| | 191 | Number of 1 Bits | Easy |
| | 190 | Reverse Bits | Easy |
| [Swift](./Array/RotateArray.swift) | 189 | Rotate Array | Easy |
| | 188 | Best Time to Buy and Sell Stock IV | Hard |
| | 187 | Repeated DNA Sequences | Medium |
| | 186 | Reverse Words in a String II | Medium |
| | 179 | Largest Number | Medium |
| | 174 | Dungeon Game | Hard |
| | 173 | Binary Search Tree Iterator | Medium |
| | 172 | Factorial Trailing Zeroes | Easy |
| [Swift](./Math/ExcelSheetColumnNumber.swift) | 171 | Excel Sheet Column Number | Easy |
| | 170 | Two Sum III - Data structure design | Easy |
| | 169 | Majority Element | Easy |
| | 168 | Excel Sheet Column Title | Easy |
| | 167 | Two Sum II - Input array is sorted | Medium |
| | 166 | Fraction to Recurring Decimal | Medium |
| | 165 | Compare Version Numbers | Easy |
| | 164 | Maximum Gap | Hard |
| | 163 | Missing Ranges | Medium |
| [Swift](./Search/FindPeakElement.swift) | 162 | Find Peak Element | Medium |
| [Swift](./String/OneEditDistance.swift) | 161 | One Edit Distance | Medium |
| | 160 | Intersection of Two Linked Lists | Easy |
| | 159 | Longest Substring with At Most Two Distinct Characters | Hard |
| | 158 | Read N Characters Given Read4 II - Call multiple times | Hard |
| | 157 | Read N Characters Given Read4 | Easy |
| | 156 | Binary Tree Upside Down | Medium |
| | 155 | Min Stack | Easy |
| [Swift](./Search/FindMinimumRotatedSortedArrayII.swift) | 154 | Find Minimum in Rotated Sorted Array II | Hard |
| [Swift](./Search/FindMinimumRotatedSortedArray.swift) | 153 | Find Minimum in Rotated Sorted Array | Medium |
| [Swift](./DP/MaximumProductSubarray.swift) | 152 | Maximum Product Subarray | Medium |
| | 151 | Reverse Words in a String | Medium |
| [Swift](./Stack/EvaluateReversePolishNotation.swift) | 150 | Evaluate Reverse Polish Notation | Medium |
| | 149 | Max Points on a Line | Hard |
| | 148 | Sort List | Medium |
| | 147 | Insertion Sort List | Medium |
| | 146 | LRU Cache | Hard |
| [Swift](./Stack/PostorderTraversal.swift) | 145 | Binary Tree Postorder Traversal | Hard |
| [Swift](./Stack/PreorderTraversal.swift) | 144 | Binary Tree Preorder Traversal | Medium |
| [Swift](./LinkedList/ReorderList.swift) | 143 | Reorder List | Medium |
| | 142 | Linked List Cycle II | Medium |
| | 141 | Linked List Cycle | Easy |
| | 140 | Word Break II | Hard |
| | 139 | Word Break | Medium |
| | 138 | Copy List with Random Pointer | Hard |
| [Swift](./Math/SingleNumberII.swift) | 137 | Single Number II | Medium |
| [Swift](./Math/SingleNumber.swift) | 136 | Single Number | Medium |
| | 135 | Candy | Hard |
| | 134 | Gas Station | Medium |
| | 133 | Clone Graph | Medium |
| | 132 | Palindrome Partitioning II | Hard |
| | 131 | Palindrome Partitioning | Medium |
| | 130 | Surrounded Regions | Medium |
| | 129 | Sum Root to Leaf Numbers | Medium |
| | 128 | Longest Consecutive Sequence | Hard |
| | 127 | Word Ladder | Medium |
| | 126 | Word Ladder II | Hard |
| | 125 | Valid Palindrome | Easy |
| | 124 | Binary Tree Maximum Path Sum | Hard |
| | 123 | Best Time to Buy and Sell Stock III | Hard |
| | 122 | Best Time to Buy and Sell Stock II | Medium |
| [Swift](./DP/BestTimeBuySellStock.swift) | 121 | Best Time to Buy and Sell Stock | Easy |
| | 120 | Triangle | Medium |
| | 119 | Pascal's Triangle II | Easy |
| | 118 | Pascal's Triangle | Easy |
| | 117 | Populating Next Right Pointers in Each Node II | Hard |
| | 116 | Populating Next Right Pointers in Each Node | Medium |
| | 115 | Distinct Subsequences | Hard |
| | 114 | Flatten Binary Tree to Linked List | Medium |
| [Swift](./Tree/PathSumII.swift) | 113 | Path Sum II | Medium |
| [Swift](./Tree/PathSum.swift) | 112 | Path Sum | Easy |
| [Swift](./Tree/MinimumDepthOfBinaryTree.swift) | 111 | Minimum Depth of Binary Tree | Easy |
| [Swift](./Tree/BalancedBinaryTree.swift) | 110 | Balanced Binary Tree | Easy |
| | 109 | Convert Sorted List to Binary Search Tree | Medium |
| | 108 | Convert Sorted Array to Binary Search Tree | Medium |
| [Swift](./Tree/BinaryTreeLevelOrderTraversalII.swift) | 107 | Binary Tree Level Order Traversal II | Easy |
| [Swift](./Tree/ConstructBinaryTreeInorderPostorder.swift) | 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium |
| [Swift](./Tree/ConstructBinaryTreePreorderInorder.swift) | 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium |
| [Swift](./Tree/MaximumDepthOfBinaryTree.swift) | 104 | Maximum Depth of Binary Tree | Easy |
| [Swift](./Tree/BinaryTreeZigzagLevelOrderTraversal.swift) | 103 | Binary Tree Zigzag Level Order Traversal | Medium |
| [Swift](./Tree/BinaryTreeLevelOrderTraversal.swift) | 102 | Binary Tree Level Order Traversal | Easy |
| [Swift](./Tree/SymmetricTree.swift) | 101 | Symmetric Tree | Easy |
| | 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium |
| [Swift](./DP/HouseRobber.swift) | 198 | [House Robber](https://leetcode.com/problems/house-robber/) | Easy |
| | 191 | [Number of 1 Bits](https://oj.leetcode.com/problems/number-of-1-bits/) | Easy |
| | 190 | [Reverse Bits](https://oj.leetcode.com/problems/reverse-bits/) | Easy |
| [Swift](./Array/RotateArray.swift) | 189 | [Rotate Array](https://oj.leetcode.com/problems/rotate-array/) | Easy |
| | 188 | [Best Time to Buy and Sell Stock IV](https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | Hard |
| | 187 | [Repeated DNA Sequences](https://oj.leetcode.com/problems/repeated-dna-sequences/) | Medium |
| | 186 | [Reverse Words in a String II](https://oj.leetcode.com/problems/reverse-words-in-a-string-ii/) ♥ | Medium |
| | 179 | [Largest Number](https://oj.leetcode.com/problems/largest-number/) | Medium |
| | 174 | [Dungeon Game](https://oj.leetcode.com/problems/dungeon-game/) | Hard |
| | 173 | [Binary Search Tree Iterator](https://oj.leetcode.com/problems/binary-search-tree-iterator/) | Medium |
| | 172 | [Factorial Trailing Zeroes](https://oj.leetcode.com/problems/factorial-trailing-zeroes/) | Easy |
| [Swift](./Math/ExcelSheetColumnNumber.swift) | 171 | [Excel Sheet Column Number](https://oj.leetcode.com/problems/excel-sheet-column-number/) | Easy |
| | 170 | [Two Sum III - Data structure design](https://oj.leetcode.com/problems/two-sum-iii-data-structure-design/) ♥ | Easy |
| | 169 | [Majority Element](https://oj.leetcode.com/problems/majority-element/) | Easy |
| | 168 | [Excel Sheet Column Title](https://oj.leetcode.com/problems/excel-sheet-column-title/) | Easy |
| | 167 | [Two Sum II - Input array is sorted](https://oj.leetcode.com/problems/two-sum-ii-input-array-is-sorted/) ♥ | Medium |
| | 166 | [Fraction to Recurring Decimal](https://oj.leetcode.com/problems/fraction-to-recurring-decimal/) | Medium |
| | 165 | [Compare Version Numbers](https://oj.leetcode.com/problems/compare-version-numbers/) | Easy |
| | 164 | [Maximum Gap](https://oj.leetcode.com/problems/maximum-gap/) | Hard |
| | 163 | [Missing Ranges](https://oj.leetcode.com/problems/missing-ranges/) ♥ | Medium |
| [Swift](./Search/FindPeakElement.swift) | 162 | [Find Peak Element](https://oj.leetcode.com/problems/find-peak-element/) | Medium |
| [Swift](./String/OneEditDistance.swift) | 161 | [One Edit Distance](https://oj.leetcode.com/problems/one-edit-distance/)♥ | Medium |
| | 160 | [Intersection of Two Linked Lists](https://oj.leetcode.com/problems/intersection-of-two-linked-lists/) | Easy |
| | 159 | [Longest Substring with At Most Two Distinct Characters](https://oj.leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/) ♥ | Hard |
| | 158 | [Read N Characters Given Read4 II - Call multiple times](https://oj.leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) ♥ | Hard |
| | 157 | [Read N Characters Given Read4](https://oj.leetcode.com/problems/read-n-characters-given-read4/) ♥ | Easy |
| | 156 | [Binary Tree Upside Down](https://oj.leetcode.com/problems/binary-tree-upside-down/) ♥ | Medium |
| | 155 | [Min Stack](https://oj.leetcode.com/problems/min-stack/) | Easy |
| [Swift](./Search/FindMinimumRotatedSortedArrayII.swift) | 154 | [Find Minimum in Rotated Sorted Array II](https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | Hard |
| [Swift](./Search/FindMinimumRotatedSortedArray.swift) | 153 | [Find Minimum in Rotated Sorted Array](https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
| [Swift](./DP/MaximumProductSubarray.swift) | 152 | [Maximum Product Subarray](https://oj.leetcode.com/problems/maximum-product-subarray/) | Medium |
| | 151 | [Reverse Words in a String](https://oj.leetcode.com/problems/reverse-words-in-a-string/) | Medium |
| [Swift](./Stack/EvaluateReversePolishNotation.swift) | 150 | [Evaluate Reverse Polish Notation](https://oj.leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium |
| | 149 | [Max Points on a Line](https://oj.leetcode.com/problems/max-points-on-a-line/) | Hard |
| | 148 | [Sort List](https://oj.leetcode.com/problems/sort-list/) | Medium |
| | 147 | [Insertion Sort List](https://oj.leetcode.com/problems/insertion-sort-list/) | Medium |
| | 146 | [LRU Cache](https://oj.leetcode.com/problems/lru-cache/) | Hard |
| [Swift](./Stack/PostorderTraversal.swift) | 145 | [Binary Tree Postorder Traversal](https://oj.leetcode.com/problems/binary-tree-postorder-traversal/) | Hard |
| [Swift](./Stack/PreorderTraversal.swift) | 144 | [Binary Tree Preorder Traversal](https://oj.leetcode.com/problems/binary-tree-preorder-traversal/) | Medium |
| [Swift](./LinkedList/ReorderList.swift) | 143 | [Reorder List](https://oj.leetcode.com/problems/reorder-list/) | Medium |
| | 142 | [Linked List Cycle II](https://oj.leetcode.com/problems/linked-list-cycle-ii/) | Medium |
| | 141 | [Linked List Cycle](https://oj.leetcode.com/problems/linked-list-cycle/) | Easy |
| | 140 | [Word Break II](https://oj.leetcode.com/problems/word-break-ii/) | Hard |
| | 139 | [Word Break](https://oj.leetcode.com/problems/word-break/) | Medium |
| | 138 | [Copy List with Random Pointer](https://oj.leetcode.com/problems/copy-list-with-random-pointer/) | Hard |
| [Swift](./Math/SingleNumberII.swift) | 137 | [Single Number II](https://oj.leetcode.com/problems/single-number-ii/) | Medium |
| [Swift](./Math/SingleNumber.swift) | 136 | [Single Number](https://oj.leetcode.com/problems/single-number/) | Medium |
| | 135 | [Candy](https://oj.leetcode.com/problems/candy/) | Hard |
| | 134 | [Gas Station](https://oj.leetcode.com/problems/gas-station/) | Medium |
| | 133 | [Clone Graph](https://oj.leetcode.com/problems/clone-graph/) | Medium |
| | 132 | [Palindrome Partitioning II](https://oj.leetcode.com/problems/palindrome-partitioning-ii/) | Hard |
| | 131 | [Palindrome Partitioning](https://oj.leetcode.com/problems/palindrome-partitioning/) | Medium |
| | 130 | [Surrounded Regions](https://oj.leetcode.com/problems/surrounded-regions/) | Medium |
| | 129 | [Sum Root to Leaf Numbers](https://oj.leetcode.com/problems/sum-root-to-leaf-numbers/) | Medium |
| | 128 | [Longest Consecutive Sequence](https://oj.leetcode.com/problems/longest-consecutive-sequence/) | Hard |
| | 127 | [Word Ladder](https://oj.leetcode.com/problems/word-ladder/) | Medium |
| | 126 | [Word Ladder II](https://oj.leetcode.com/problems/word-ladder-ii/) | Hard |
| | 125 | [Valid Palindrome](https://oj.leetcode.com/problems/valid-palindrome/) | Easy |
| | 124 | [Binary Tree Maximum Path Sum](https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard |
| | 123 | [Best Time to Buy and Sell Stock III](https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | Hard |
| | 122 | [Best Time to Buy and Sell Stock II](https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Medium |
| [Swift](./DP/BestTimeBuySellStock.swift) | 121 | [Best Time to Buy and Sell Stock](https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy |
| | 120 | [Triangle](https://oj.leetcode.com/problems/triangle/) | Medium |
| | 119 | [Pascal's Triangle II](https://oj.leetcode.com/problems/pascals-triangle-ii/) | Easy |
| | 118 | [Pascal's Triangle](https://oj.leetcode.com/problems/pascals-triangle/) | Easy |
| | 117 | [Populating Next Right Pointers in Each Node II](https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | Hard |
| | 116 | [Populating Next Right Pointers in Each Node](https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/) | Medium |
| | 115 | [Distinct Subsequences](https://oj.leetcode.com/problems/distinct-subsequences/) | Hard |
| | 114 | [Flatten Binary Tree to Linked List](https://oj.leetcode.com/problems/flatten-binary-tree-to-linked-list/) | Medium |
| [Swift](./Tree/PathSumII.swift) | 113 | [Path Sum II](https://oj.leetcode.com/problems/path-sum-ii/) | Medium |
| [Swift](./Tree/PathSum.swift) | 112 | [Path Sum](https://oj.leetcode.com/problems/path-sum/) | Easy |
| [Swift](./Tree/MinimumDepthOfBinaryTree.swift) | 111 | [Minimum Depth of Binary Tree](https://oj.leetcode.com/problems/minimum-depth-of-binary-tree/) | Easy |
| [Swift](./Tree/BalancedBinaryTree.swift) | 110 | [Balanced Binary Tree](https://oj.leetcode.com/problems/balanced-binary-tree/) | Easy |
| | 109 | [Convert Sorted List to Binary Search Tree](https://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | Medium |
| | 108 | [Convert Sorted Array to Binary Search Tree](https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | Medium |
| [Swift](./Tree/BinaryTreeLevelOrderTraversalII.swift) | 107 | [Binary Tree Level Order Traversal II](https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/) | Easy |
| [Swift](./Tree/ConstructBinaryTreeInorderPostorder.swift) | 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | Medium |
| [Swift](./Tree/ConstructBinaryTreePreorderInorder.swift) | 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
| [Swift](./Tree/MaximumDepthOfBinaryTree.swift) | 104 | [Maximum Depth of Binary Tree](https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy |
| [Swift](./Tree/BinaryTreeZigzagLevelOrderTraversal.swift) | 103 | [Binary Tree Zigzag Level Order Traversal](https://oj.leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | Medium |
| [Swift](./Tree/BinaryTreeLevelOrderTraversal.swift) | 102 | [Binary Tree Level Order Traversal](https://oj.leetcode.com/problems/binary-tree-level-order-traversal/) | Easy |
| [Swift](./Tree/SymmetricTree.swift) | 101 | [Symmetric Tree](https://oj.leetcode.com/problems/symmetric-tree/) | Easy |
| [Swift](./Tree/SameTree.swift) | 100 | [Same Tree](https://oj.leetcode.com/problems/same-tree/) | Easy |
| | 99 | [Recover Binary Search Tree](https://oj.leetcode.com/problems/recover-binary-search-tree/) | Hard |
| [Swift](./Tree/ValidateBinarySearchTree.swift) | 98 | [Validate Binary Search Tree](https://oj.leetcode.com/problems/validate-binary-search-tree/) | Medium |
Expand Down

0 comments on commit a60f83b

Please sign in to comment.