Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit89c38c1

Browse files
committed
update doc
1 parente51583c commit89c38c1

File tree

3 files changed

+18
-7
lines changed

3 files changed

+18
-7
lines changed

‎README.md

Lines changed: 6 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -158,7 +158,7 @@ P.S.:
158158
| 118|[Pascal's Triangle](https://github.com/interviewcoder/leetcode/blob/master/src/_118_PascalsTriangle/Solution.java)| Easy|`Array`||
159159
| 119|[Pascal's Triangle II](https://github.com/interviewcoder/leetcode/blob/master/src/_119_PascalsTriangleII/Solution.java)| Easy|`Array`||
160160
| 120|[Triangle](https://github.com/interviewcoder/leetcode/blob/master/src/_120_Triangle/Solution.java)| Medium|`Array``Dynamic Programming`||
161-
| 121|[Best Time to Buy and Sell Stock](https://github.com/interviewcoder/leetcode/blob/master/src/_121_BestTimeToBuyAndSellStock/Solution.java)| Medium|`Array``Dynamic Programming`||
161+
| 121|[Best Time to Buy and Sell Stock](https://github.com/interviewcoder/leetcode/blob/master/src/_121_BestTimeToBuyAndSellStock/)| Medium|`Array``Dynamic Programming`|O(N^2) -> O(N)|
162162
| 122|[Best Time to Buy and Sell Stock II](https://github.com/interviewcoder/leetcode/blob/master/src/_122_BestTimeToBuyAndSellStockII/Solution.java)| Medium|`Array``Greedy`||
163163
| 123|[Best Time to Buy and Sell Stock III](https://github.com/interviewcoder/leetcode/blob/master/src/_123_BestTimeToBuyAndSellStockIII/Solution.java)| Hard|`Array``Dynamic Programming`||
164164
| 124|[Binary Tree Maximum Path Sum](https://github.com/interviewcoder/leetcode/blob/master/src/_124_BinaryTreeMaximumPathSum/)| Hard|`Tree``Depth-first Search`| post-order, local and global ,[README](https://github.com/interviewcoder/leetcode/tree/master/src/_124_BinaryTreeMaximumPathSum)|
@@ -186,7 +186,7 @@ P.S.:
186186
| 146|[LRU Cache](https://github.com/interviewcoder/leetcode/blob/master/src/_146_LRUCache/Solution.java)| Hard|`Data Structure`||
187187
| 147|[Insertion Sort List](https://github.com/interviewcoder/leetcode/blob/master/src/_147_InsertionSortList/Solution.java)| Medium|`Linked List``Sort`||
188188
| 148|[Sort List](https://github.com/interviewcoder/leetcode/blob/master/src/_148_SortList/Solution.java)| Medium|`Linked List``Sort`|`!` fast-slow to find middle + iterative reverse + merge sort|
189-
| 149|[Max Points on a Line](https://github.com/interviewcoder/leetcode/blob/master/src/_149_MaxPointsOnALine/Solution.java)| Hard|`Hash Table``Math`||
189+
| 149|[Max Points on a Line](https://github.com/interviewcoder/leetcode/blob/master/src/_149_MaxPointsOnALine/)| Hard|`Hash Table``Math`||
190190
| 150|[Evaluate Reverse Polish Notation](https://github.com/interviewcoder/leetcode/blob/master/src/_150_EvaluateReversePolishNotation/Solution.java)| Medium|`Stack`||
191191
| 151|[Reverse Words in a String](https://github.com/interviewcoder/leetcode/blob/master/src/_151_ReverseWordsInAString/Solution.java)| Medium|`String`|[README](https://github.com/interviewcoder/leetcode/blob/master/src/_151_ReverseWordsInAString/README.md)|
192192
| 152|[Maximum Product Subarray](https://github.com/interviewcoder/leetcode/blob/master/src/_152_MaximumProductSubarray/Solution.java)| Medium|`Array``Dynamic Programming`||
@@ -234,7 +234,7 @@ P.S.:
234234
| 215|[Kth Largest Element in an Array](https://github.com/interviewcoder/leetcode/blob/master/src/_215_KthLargestElementInAnArray/Solution.java)| Medium|`Divide and Conquer``Heap`| max-heap using Java's Priority Queue|
235235
| 216|[Combination Sum III](https://github.com/interviewcoder/leetcode/blob/master/src/_216_CombinationSumIII/Solution.java)| Medium|`Array``Backtracking`||
236236
| 217|[Contains Duplicate](https://github.com/interviewcoder/leetcode/blob/master/src/_217_ContainsDuplicate/Solution.java)| Easy|`Array``Hash Table`||
237-
| 218| The Skyline Problem| Hard|`Divide and Conquer``Heap`||
237+
| 218|[The Skyline Problem](https://github.com/interviewcoder/leetcode/blob/master/src/_218_TheSkylineProblem/Solution.java)| Hard|`Divide and Conquer``Heap`||
238238
| 219|[Contains Duplicate II](https://github.com/interviewcoder/leetcode/blob/master/src/_219_ContainsDuplicateII/Solution.java)| Easy|`Array``Hash Table`||
239239
| 220|[Contains Duplicate III](https://github.com/interviewcoder/leetcode/blob/master/src/_220_ContainsDuplicateIII/Solution.java)| Medium|`Binary Search Tree`||
240240
| 221|[Maximal Square](https://github.com/interviewcoder/leetcode/blob/master/src/_221_MaximalSquare/Solution.java)| Medium|`Dynamic Programming`||
@@ -254,20 +254,22 @@ P.S.:
254254
| 235|[Lowest Common Ancestor of a Binary Search Tree](https://github.com/interviewcoder/leetcode/blob/master/src/_235_LowestCommonAncestorOfABinarySearchTree/Solution.java)| Easy|`Tree`||
255255
| 236|[Lowest Common Ancestor of a Binary Tree](https://github.com/interviewcoder/leetcode/blob/master/src/_236_LowestCommonAncestorOfABinaryTree/)| Medium|`Tree`|[README](https://github.com/interviewcoder/leetcode/tree/master/src/_236_LowestCommonAncestorOfABinaryTree)|
256256
| 237|[Delete Node in a Linked List](https://github.com/interviewcoder/leetcode/blob/master/src/_237_DeleteNodeInALinkedList/Solution.java)| Easy|`Linked List`||
257-
| 238|[Product of Array Except Self](https://github.com/interviewcoder/leetcode/blob/master/src/_238_ProductOfArrayExceptSelf/Solution.java)| Medium|`Array`||
257+
| 238|[Product of Array Except Self](https://github.com/interviewcoder/leetcode/blob/master/src/_238_ProductOfArrayExceptSelf/)| Medium|`Array`|O(N^2) -> two pass O(N)|
258258
| 239|[Sliding Window Maximum](https://github.com/interviewcoder/leetcode/blob/master/src/_239_SlidingWindowMaximum/Solution.java)| Hard|`Heap`| descending queue|
259259
| 240|[Search a 2D Matrix II](https://github.com/interviewcoder/leetcode/blob/master/src/_240_SearchA2DMatrixII/Solution.java)| Medium|`Divide and Conquer``Binary Search`||
260260
| 241| Different Ways to Add Parentheses| Medium|`Divide and Conquer`||
261261
| 242|[Valid Anagram](https://github.com/interviewcoder/leetcode/blob/master/src/_242_ValidAnagram/Solution.java)| Easy|`Hash Table``Sort`||
262262
| 251|[Flatten2DVector](https://github.com/interviewcoder/leetcode/tree/master/src/_251_Flatten2DVector)| Medium|`Design`||
263263
| 252|[Meeting Rooms](https://github.com/interviewcoder/leetcode/tree/master/src/_252_MeetingRooms)| Easy|`Sort`||
264264
| 253|[Meeting Rooms II](https://github.com/interviewcoder/leetcode/tree/master/src/_253_MeetingRoomsII)| Medium|`Heap``Greedy``Sort`||
265+
| 256|[Paint House](https://github.com/interviewcoder/leetcode/tree/master/src/_256_PaintHouse)| Medium|`Dynamic Programming`||
265266
| 257| Binary Tree Paths| Easy|`Tree`||
266267
| 258| Add Digits| Easy|`Math`||
267268
| 260| Single Number III| Medium|`Bit Manipulation`||
268269
| 261|[Graph Valid Tree](https://github.com/interviewcoder/leetcode/tree/master/src/_261_GraphValidTree)| Medium|`Breadth-first Search``Depth-first Search``Graph``Union-Find`||
269270
| 263| Ugly Number| Easy|`Math`||
270271
| 264| Ugly Number II| Medium|`Math``Heap`||
272+
| 265|[Paint House](https://github.com/interviewcoder/leetcode/tree/master/src/_265_PaintHouseII)| Hard|`Dynamic Programming`||
271273
| 268|[Missing Number](https://github.com/interviewcoder/leetcode/blob/master/src/_268_MissingNumber/Solution.java)| Medium|`Array``Math``Bit Manipulation`||
272274
| 269|[Alien Dictionary](https://github.com/interviewcoder/leetcode/tree/master/src/_269_AlienDictionary)| Hard|`Graph``Topological Sort`| BFS|
273275
| 273|[Integer to English Words](https://github.com/interviewcoder/leetcode/blob/master/src/_273_IntegerToEnglishWords/Solution.java)| Medium|`Math``String`||

‎doc/category_dp.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -36,6 +36,8 @@
3636
| Matrix : max/`min`(*)| 120| Triangle||
3737
| Matrix : max/`min`(*)| 174| Dungeon Game| hard|
3838
| Matrix : max/`min`(*)| 064| Minimum Path Sum||
39+
| Matrix : max/`min`(*)| 256|[Paint House](https://github.com/interviewcoder/leetcode/tree/master/src/_256_PaintHouse)||
40+
| Matrix : max/`min`(*)| 265|[Paint House](https://github.com/interviewcoder/leetcode/tree/master/src/_265_PaintHouseII)||
3941
| Matrix :`max`/min(*)| 085| Maximal Rectangle||
4042
| Matrix :`max`/min(*)| 221| Maximal Square||
4143
| Matrix : count(*)| 062| Unique Paths||

‎doc/category_math.md

Lines changed: 10 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,13 @@ keep indices of numbers which are in ascending/descending order
44

55
| Type| #| Description|
66
| ---------------------:|:---:| :------------|
7-
| calculation| 029|[Divide Two Integers](https://github.com/interviewcoder/leetcode/blob/master/src/_029_DivideTwoIntegers/)|
8-
| calculation| 166|[Fraction To Recurring Decimal](https://github.com/interviewcoder/leetcode/blob/master/src/_166_FractionToRecurringDecimal/Solution.java)|
9-
| offset BASE| 168|[Excel Sheet Column Title](https://github.com/interviewcoder/leetcode/blob/master/src/_168_ExcelSheetColumnTitle/Solution.java)|
7+
| calculation :`+`| 066|[Plus One](https://github.com/interviewcoder/leetcode/blob/master/src/_066_PlusOne/Solution.java)|
8+
| calculation :`/`| 029|[Divide Two Integers](https://github.com/interviewcoder/leetcode/blob/master/src/_029_DivideTwoIntegers/)|
9+
| calculation :`*`| 043|[Mutltiply Strings](https://github.com/interviewcoder/leetcode/tree/master/src/_043_MultiplyStrings)|
10+
| calculation :`/`| 166|[Fraction To Recurring Decimal](https://github.com/interviewcoder/leetcode/blob/master/src/_166_FractionToRecurringDecimal/Solution.java)|
11+
| calculation :`x^n`| 050|[Power(x, n)](https://github.com/interviewcoder/leetcode/tree/master/src/_050_PowxN)|
12+
| calculation :`sqr`| 069|[Sqrt](https://github.com/interviewcoder/leetcode/tree/master/src/_069_Sqrtx)|
13+
| BASE| 012|[Integer to Roman](https://github.com/interviewcoder/leetcode/blob/master/src/_012_IntegerToRoman/Solution.java)|
14+
| BASE| 013|[Roman To Integer](https://github.com/interviewcoder/leetcode/blob/master/src/_013_RomanToInteger/Solution.java)|
15+
| offset BASE| 168|[Excel Sheet Column Title](https://github.com/interviewcoder/leetcode/blob/master/src/_168_ExcelSheetColumnTitle/Solution.java)|
16+
| BASE| 171|[Excel Sheet to Column Number](https://github.com/interviewcoder/leetcode/blob/master/src/_171_ExcelSheetColumnNumber/Solution.java)|

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp