Calinescu Valentin
|
be07e383db
|
Merge pull request #93 from Vally79/master
added bulbSwitcher
|
2015-12-28 18:37:21 +02:00 |
|
Vally
|
6de2970f38
|
added bulbSwitcher
|
2015-12-28 18:36:22 +02:00 |
|
Hao Chen
|
c545d4c074
|
Merge pull request #91 from cirosantilli/gitignore-class
gitignore *.class files for those without IDE
|
2015-12-17 10:46:00 +08:00 |
|
Hao Chen
|
52484f0487
|
java LRUCache with LinkedHashMap
|
2015-12-10 14:06:15 -02:00 |
|
Hao Chen
|
119a905426
|
gitignore java *.class files for those without IDE
|
2015-12-10 07:30:04 -02:00 |
|
Calinescu Valentin
|
625ad10464
|
Merge pull request #89 from Vally79/master
fixed README
|
2015-12-08 15:20:09 +02:00 |
|
Vally
|
fe401f4043
|
fixed README
|
2015-12-08 15:19:41 +02:00 |
|
Calinescu Valentin
|
f9cbf38251
|
Merge pull request #88 from Vally79/master
added countOfSmallerNumbersAfterSelf
|
2015-12-08 15:19:00 +02:00 |
|
Vally
|
358b682365
|
added countOfSmallerNumbersAfterSelf
|
2015-12-08 15:18:07 +02:00 |
|
Hao Chen
|
f54adeed91
|
refactory the code
|
2015-11-25 00:55:27 +08:00 |
|
Hao Chen
|
9dd87d49e4
|
simpler solution
|
2015-11-25 00:00:03 +08:00 |
|
Hao Chen
|
ccadca1ecc
|
another implementation
|
2015-11-24 23:38:25 +08:00 |
|
Hao Chen
|
1a64b361e9
|
refactory the code
|
2015-11-24 22:56:22 +08:00 |
|
Hao Chen
|
99c6cf90c1
|
fix a bug
|
2015-11-24 22:41:05 +08:00 |
|
Hao Chen
|
aa01eb840e
|
refactory the code
|
2015-11-24 22:23:25 +08:00 |
|
Hao Chen
|
9b2b69893c
|
New Problem"Range Sum Query - Mutable"
|
2015-11-24 19:11:13 +08:00 |
|
Hao Chen
|
7a7232643b
|
refactory the code
|
2015-11-23 09:44:35 +08:00 |
|
Hao Chen
|
80be55345f
|
New Problem "Additive Number"
|
2015-11-22 21:09:54 +08:00 |
|
Hao Chen
|
fa2df8233a
|
New Problem "Find Median from Data Stream"
|
2015-11-14 17:34:35 +08:00 |
|
Hao Chen
|
d99a27c058
|
New Problem "Range Sum Query 2D - Immutable"
|
2015-11-14 11:29:19 +08:00 |
|
Hao Chen
|
19a4e2302f
|
add editor name
|
2015-11-12 10:48:54 +08:00 |
|
Hao Chen
|
9be7730ca0
|
refactory the code
|
2015-11-12 10:48:23 +08:00 |
|
Hao Chen
|
059fea4db5
|
New Problem "Remove Invalid Parentheses"
|
2015-11-11 17:56:22 +08:00 |
|
Hao Chen
|
c732b59def
|
Merge branch 'master' of github.com:haoel/leetcode
|
2015-11-10 23:35:35 +08:00 |
|
Hao Chen
|
b2f6fa68d3
|
another DFS implementation
|
2015-11-10 23:34:28 +08:00 |
|
Calinescu Valentin
|
a73707755f
|
Merge pull request #86 from Vally79/master
added rangeSumQuery-Immutable
|
2015-11-10 14:55:34 +02:00 |
|
Vally
|
db2461262c
|
added rangeSumQuery-Immutable
|
2015-11-10 14:54:25 +02:00 |
|
Hao Chen
|
4a7fb6fe5f
|
another implementation
|
2015-11-10 18:34:15 +08:00 |
|
Hao Chen
|
065f8e8024
|
New Problem "Serialize and Deserialize Binary Tree"
|
2015-11-10 12:16:03 +08:00 |
|
Hao Chen
|
d648361097
|
New Problem "Peeking Iterator"
|
2015-11-10 09:25:03 +08:00 |
|
Hao Chen
|
c0229657f7
|
correct the algorithm from O(n) to O(log(n))
|
2015-11-08 12:55:31 +08:00 |
|
Hao Chen
|
d173f1e6de
|
add a bit more clear implementation
|
2015-11-08 12:54:02 +08:00 |
|
Calinescu Valentin
|
80eba4ceec
|
Merge pull request #85 from Vally79/master
added longestIncreasingSubsequence
|
2015-11-06 15:12:33 +02:00 |
|
Vally
|
27087dac29
|
added longestIncreasingSubsequence
|
2015-11-06 15:11:34 +02:00 |
|
Calinescu Valentin
|
99f5133fb7
|
Merge pull request #84 from Vally79/master
added bullsAndCows
|
2015-11-04 17:29:08 +02:00 |
|
Vally
|
376a7ebe90
|
added bullsAndCows
|
2015-11-04 17:27:49 +02:00 |
|
Hao Chen
|
3475545441
|
Merge branch 'master' of github.com:haoel/leetcode
|
2015-11-04 08:31:09 +08:00 |
|
Hao Chen
|
9b15c6aeac
|
comments
|
2015-11-04 08:30:53 +08:00 |
|
Calinescu Valentin
|
a4ea8c6e01
|
Merge pull request #83 from Vally79/master
added binaryTreePaths and h-Index_II
|
2015-11-03 21:33:01 +02:00 |
|
Vally
|
65427e833b
|
added binaryTreePaths and h-Index_II
|
2015-11-03 21:32:13 +02:00 |
|
Calinescu Valentin
|
edc90061b0
|
Merge pull request #82 from xusiwei/master
new solutions of "Populating Next Right Pointers in Each Node"
|
2015-11-03 20:51:22 +02:00 |
|
Siwei Xu
|
bdd315b1a7
|
new solutions of "Populating Next Right Pointers in Each Node"
1) level order traversal by a explicit queue
2) constant space, use `next` pointer to represent the queue
|
2015-10-26 18:44:33 +08:00 |
|
Hao Chen
|
f874fde0ac
|
New Problem "Perfect Squares"
|
2015-10-25 22:24:49 +08:00 |
|
Hao Chen
|
1ba3b95ba7
|
Another implemtation which is easy to understand
|
2015-10-25 21:29:38 +08:00 |
|
Hao Chen
|
f7e17dbda0
|
Merge pull request #79 from cijianzy/master
updated README
|
2015-10-25 20:28:56 +08:00 |
|
cijianzy
|
854cb09331
|
updated README
|
2015-10-25 00:51:39 +08:00 |
|
Hao Chen
|
8c3448aecb
|
correct the algorithm to meet the problem's requirement - the array is ready only
|
2015-10-23 08:41:27 +08:00 |
|
Hao Chen
|
5b43c59419
|
Merge branch 'master' of github.com:haoel/leetcode
|
2015-10-22 23:47:23 +08:00 |
|
Hao Chen
|
2674c338c0
|
New Problem "Word Pattern"
|
2015-10-22 23:46:43 +08:00 |
|
Hao Chen
|
3e2fc1606f
|
Merge pull request #77 from Vally79/master
added h-Index
|
2015-10-22 22:59:18 +08:00 |
|