posted @ 2019-10-21 09:48
neverlandly
阅读(4)
推荐(0)
posted @ 2019-10-21 08:02
neverlandly
阅读(4)
推荐(0)
posted @ 2019-10-21 06:37
neverlandly
阅读(2)
推荐(0)
posted @ 2019-10-21 02:44
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-20 15:22
neverlandly
阅读(5)
推荐(0)
posted @ 2019-10-20 08:05
neverlandly
阅读(4)
推荐(0)
posted @ 2019-10-20 05:57
neverlandly
阅读(2)
推荐(0)
摘要:
Note: The size of the BST will not exceed 50. The BST is always valid and each node's value is different. Note: The size of the BST will not exceed 50
阅读全文
posted @ 2019-10-18 15:04
neverlandly
阅读(213)
推荐(0)
posted @ 2019-10-18 13:25
neverlandly
阅读(2)
推荐(0)
摘要:
HashMap Sort and replace S from right to left (未深究)
阅读全文
posted @ 2019-10-18 12:57
neverlandly
阅读(133)
推荐(0)
posted @ 2019-10-18 10:21
neverlandly
阅读(4)
推荐(0)
posted @ 2019-10-17 15:28
neverlandly
阅读(17)
推荐(0)
posted @ 2019-10-17 14:24
neverlandly
阅读(5)
推荐(0)
摘要:
X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotated - we cannot choose to leave it alone. A number i
阅读全文
posted @ 2019-10-17 12:21
neverlandly
阅读(133)
推荐(0)
posted @ 2019-10-16 15:38
neverlandly
阅读(2)
推荐(0)
posted @ 2019-10-16 13:22
neverlandly
阅读(4)
推荐(0)
posted @ 2019-10-16 09:51
neverlandly
阅读(3)
推荐(0)
摘要:
The idea is to keep string builder and appending until the length A is greater or equal to B. use a while loop to keep adding A to stringBuilder until
阅读全文
posted @ 2019-10-15 15:28
neverlandly
阅读(73)
推荐(0)
posted @ 2019-10-15 13:50
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-15 10:14
neverlandly
阅读(2)
推荐(0)
posted @ 2019-10-14 15:08
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-14 13:21
neverlandly
阅读(2)
推荐(0)
摘要:
1-liner s.contains("") normally is O(nm), but can be optimized to be O(n) O(n) scan
阅读全文
posted @ 2019-10-14 11:43
neverlandly
阅读(132)
推荐(0)
摘要:
没有想到要再存一个HashMap, appearance to character mapping
阅读全文
posted @ 2019-10-14 08:34
neverlandly
阅读(516)
推荐(0)
posted @ 2019-10-13 09:26
neverlandly
阅读(4)
推荐(0)
摘要:
Given a robot cleaner in a room modeled as a grid. Each cell in the grid can be empty or blocked. The robot cleaner with 4 given APIs can move forward, turn left or turn right. Each turn it made is...
阅读全文
posted @ 2019-10-13 07:43
neverlandly
阅读(267)
推荐(0)
posted @ 2019-10-13 05:53
neverlandly
阅读(3)
推荐(0)
摘要:
If stone a and stone b are in the same column/row, we connect them as a component The largest possible number of moves we can make = the number of uni
阅读全文
posted @ 2019-10-12 15:03
neverlandly
阅读(194)
推荐(0)
posted @ 2019-10-12 13:33
neverlandly
阅读(2)
推荐(0)
posted @ 2019-10-11 14:01
neverlandly
阅读(5)
推荐(0)
posted @ 2019-10-10 16:04
neverlandly
阅读(7)
推荐(0)
摘要:
Backtracking: every time draw two cards, calculate the possible results, and add one result to the nextRound list. The nextRound list will have the re
阅读全文
posted @ 2019-10-10 14:10
neverlandly
阅读(194)
推荐(0)
posted @ 2019-10-10 10:33
neverlandly
阅读(2)
推荐(0)
posted @ 2019-10-09 15:52
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-09 15:05
neverlandly
阅读(2)
推荐(0)
posted @ 2019-10-09 13:53
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-08 16:29
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-07 14:44
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-07 11:31
neverlandly
阅读(3)
推荐(0)
posted @ 2019-10-07 09:29
neverlandly
阅读(6)
推荐(0)