Hao Chen
|
94cfacfd9c
|
using int instead of char for the counter map
|
2014-12-06 09:51:49 +08:00 |
|
Hao Chen
|
e9884b32d2
|
new problem "Find Peak Element"
|
2014-12-05 21:39:27 +08:00 |
|
Hao Chen
|
a0dd575318
|
new problem "One Edit Distance "
|
2014-12-03 17:51:34 +08:00 |
|
Hao Chen
|
8ad32f6697
|
Merge branch 'jakwings-patch'
|
2014-12-01 14:20:26 +08:00 |
|
Hao Chen
|
949acc5421
|
Merge branch 'patch-3' of https://github.com/jakwings/leetcode into jakwings-patch
|
2014-12-01 14:19:40 +08:00 |
|
Hao Chen
|
e6fdaded78
|
new problems
|
2014-12-01 14:06:40 +08:00 |
|
Hao Chen
|
8d8baaa9ce
|
Merge branch 'jakwings-patch'
|
2014-11-30 10:41:16 +08:00 |
|
Hao Chen
|
35a7ce76f8
|
add some comments
|
2014-11-30 10:40:45 +08:00 |
|
Hao Chen
|
a41e4b396b
|
Merge pull request #37 from gdqyn/master
modify wordSearch.cpp complile error
|
2014-11-30 10:09:57 +08:00 |
|
JOKER
|
81135fa92f
|
reduce time complexity O(n²) to O(n)
the solution can be optimized by calculating the height in the same recursion rather than calling a height() function separately.
|
2014-11-29 18:42:54 +08:00 |
|
Jak Wings
|
be5c0e0c3d
|
Pointers to pointers are very useful for tracking a node.
|
2014-11-28 18:14:34 +08:00 |
|
gdqyn
|
907b0f3c02
|
modify wordSearch.cpp complile error
|
2014-11-26 18:07:43 +08:00 |
|
Jak Wings
|
616f02d7a1
|
more readable code
|
2014-11-24 23:11:17 +08:00 |
|
Hao Chen
|
ae1f15ba77
|
Read N Characters Given Read4
|
2014-11-20 17:59:45 +08:00 |
|
Hao Chen
|
8711a9ae13
|
add O(1) space solution for "First Missing Positive" problem. fixed #19
|
2014-11-20 16:27:09 +08:00 |
|
Hao Chen
|
0d1d25f86e
|
improve the comments (resolves #29)
|
2014-11-20 11:17:33 +08:00 |
|
Hao Chen
|
9cc5c3fe56
|
Merge branch 'master' of https://github.com/t3dbundy/leetcode into t3dbundy-path
|
2014-11-20 10:43:41 +08:00 |
|
Hao Chen
|
356254b918
|
fix issue#32, and make the code more clean
|
2014-11-20 10:12:52 +08:00 |
|
t3dbundy
|
765b89f5a8
|
Update addTwoNumbers.cpp
Use pointer to pointer to simplify logic
|
2014-11-20 10:07:48 +08:00 |
|
Hao Chen
|
3fbb652b8a
|
add default test number
|
2014-11-19 18:52:48 +08:00 |
|
Hao Chen
|
058a583e90
|
Merge branch 'keenbin7-patch'
|
2014-11-19 18:51:16 +08:00 |
|
Hao Chen
|
3e43c3a7ee
|
simplify the code
|
2014-11-19 18:51:01 +08:00 |
|
keenbin7
|
1117ffbf04
|
Update pascalTriangle.II.cpp
At first, the vector doesn't have element at rowIndex.
|
2014-11-19 17:14:24 +08:00 |
|
Hao Chen
|
b0ffb4d67e
|
Add comments to explain the solutions
|
2014-11-19 00:14:24 +08:00 |
|
Hao Chen
|
44c713105b
|
Add explaination for "Single Number I/II"
|
2014-11-18 10:45:09 +08:00 |
|
Hao Chen
|
8dfaebf5d4
|
Binary Tree Upside Down
|
2014-11-17 22:58:29 +08:00 |
|
Hao Chen
|
6bf0ecedd9
|
fix the INT_MIN definition issue
|
2014-11-17 20:55:58 +08:00 |
|
Hao Chen
|
71905c31cf
|
fix the integer overflow issue
|
2014-11-17 20:55:17 +08:00 |
|
Hao Chen
|
1e0de5bc5e
|
Merge branch 'jakwings-patch'
|
2014-11-17 11:59:24 +08:00 |
|
Hao Chen
|
4cae32abc3
|
add some comments
|
2014-11-17 11:58:56 +08:00 |
|
Hao Chen
|
f59880fd2e
|
Merge branch 'patch-3' of https://github.com/jakwings/leetcode into jakwings-patch
|
2014-11-17 11:52:51 +08:00 |
|
Hao Chen
|
c5b6960f98
|
add some comments
|
2014-11-17 11:44:03 +08:00 |
|
Hao Chen
|
c8f7e2fb90
|
Merge branch 'patch-4' of https://github.com/jakwings/leetcode into jakwings-patch
|
2014-11-17 11:42:41 +08:00 |
|
Hao Chen
|
0f0fac9ffd
|
Merge branch 'patch-1' of https://github.com/jakwings/leetcode into jakwings-patch
|
2014-11-17 11:36:33 +08:00 |
|
Hao Chen
|
6f0059ac0f
|
remove copyright.sh
|
2014-11-17 11:12:21 +08:00 |
|
Hao Chen
|
3f656f1b21
|
some useful scripts
|
2014-11-17 11:10:35 +08:00 |
|
Hao Chen
|
3cb20a68fa
|
new problem's solution
|
2014-11-17 11:09:24 +08:00 |
|
Hao Chen
|
dff39d00a4
|
add some explaination
|
2014-11-17 11:08:06 +08:00 |
|
Jak Wings
|
072f548b75
|
amend the explanation of the second solution
|
2014-11-17 03:24:44 +08:00 |
|
Hao Chen
|
3dec9c4094
|
add acceptable DP solution for Longest Palindrome
|
2014-11-16 20:45:12 +08:00 |
|
Jak Wings
|
bce22bf67d
|
no twisted mathematical hack
|
2014-11-15 14:59:26 +08:00 |
|
Jak Wings
|
04a4d34dd9
|
[Anagrams] Reduce memory cost
By changing `map<string, string>` to `map<string, int>` to reduce memory cost.
|
2014-11-12 15:46:14 +08:00 |
|
Hao Chen
|
712e5ccdef
|
Merge branch 'master' of github.com:haoel/leetcode
|
2014-11-12 10:41:30 +08:00 |
|
Hao Chen
|
6c50278a57
|
Merge pull request #20 from jakwings/patch-1
[Binary Tree Postorder Traversal] reduce the run-time complexity of vector operation.
|
2014-11-12 10:40:38 +08:00 |
|
Hao Chen
|
ecfc71017e
|
typo fix
|
2014-11-12 10:30:47 +08:00 |
|
Jak Wings
|
cfe137ce56
|
use a not so expensive trick
|
2014-11-10 01:00:04 +08:00 |
|
Hao Chen
|
5775d1d563
|
Merge branch 'master' of github.com:haoel/leetcode
|
2014-11-05 00:22:36 +08:00 |
|
Hao Chen
|
33f3f48533
|
Add comments to explain the solutions
|
2014-11-05 00:21:28 +08:00 |
|
Hao Chen
|
6d790d6470
|
Merge pull request #17 from chaoxu1990/master
Update copyListWithRandomPointer.cpp
|
2014-11-03 11:36:43 +08:00 |
|
chaoxu1990
|
36f46fe73f
|
Update copyListWithRandomPointer.cpp
|
2014-11-02 18:29:51 -08:00 |
|