Jak Wings
|
c472178bdb
|
fix
Added one test case: isMatch("*aa", "*a")
|
2015-02-04 09:55:09 +08:00 |
|
Hao Chen
|
859e312c9e
|
Update README.md
|
2015-01-25 23:32:09 +08:00 |
|
Hao Chen
|
fe18df930c
|
rewrite the script to fix issue#45
|
2015-01-25 23:23:56 +08:00 |
|
Hao Chen
|
86a4a165ef
|
remove garbage in comment
|
2015-01-16 01:16:03 +08:00 |
|
Hao Chen
|
e3ae780ea8
|
New Problem "Largest Number"
|
2015-01-16 01:13:38 +08:00 |
|
Hao Chen
|
8ace5ed670
|
New Problem "Dungeon Game"
|
2015-01-16 00:38:19 +08:00 |
|
Hao Chen
|
fde26df692
|
New Problem "Binary Search Tree Iterator"
|
2014-12-31 21:48:42 +08:00 |
|
Hao Chen
|
9804379985
|
Merge branch 'jakwings-patch'
|
2014-12-30 22:33:24 +08:00 |
|
Hao Chen
|
0cccc8a64e
|
read some the comments
|
2014-12-30 22:33:05 +08:00 |
|
Jak Wings
|
7c511ddfe7
|
avoid unnecessary calculations to speed up
|
2014-12-30 22:28:24 +08:00 |
|
Hao Chen
|
a54003a598
|
a bit code optimization to resolve #23 PR
|
2014-12-30 22:18:35 +08:00 |
|
Hao Chen
|
428777d880
|
Merge branch 'FreeJoker-patch'
|
2014-12-30 22:00:55 +08:00 |
|
Hao Chen
|
843db5ce36
|
update the problem "Balanced Binary Tree"
|
2014-12-30 22:00:05 +08:00 |
|
Hao Chen
|
7268885dc8
|
Merge branch 'patch-1' of https://github.com/FreeJoker/leetcode-1 into FreeJoker-patch
|
2014-12-30 21:52:59 +08:00 |
|
Hao Chen
|
5217f8e505
|
fix the integer overflow issue
|
2014-12-30 21:24:47 +08:00 |
|
Hao Chen
|
175976a869
|
another solution for "Factorial Trailing Zeroes"
|
2014-12-30 18:01:28 +08:00 |
|
Hao Chen
|
3359f2107b
|
fix integer overflow issue
|
2014-12-30 17:56:57 +08:00 |
|
Hao Chen
|
f118acb4ee
|
New Problem "Factorial Trailing Zeroes"
|
2014-12-30 10:13:57 +08:00 |
|
Hao Chen
|
0950d3f2f6
|
update readme
|
2014-12-29 21:44:10 +08:00 |
|
Hao Chen
|
878cda2bdb
|
New Problem "Excel Sheet Column Number"
|
2014-12-29 21:40:44 +08:00 |
|
Hao Chen
|
d38122f7fc
|
New Problem "Two Sum III - Data structure design"
|
2014-12-29 21:39:57 +08:00 |
|
Hao Chen
|
5d6429d79f
|
add a case to check if the return value is overflowed, and slight optimization
|
2014-12-29 20:50:57 +08:00 |
|
Hao Chen
|
8099be0c98
|
fix a bug which passed wrong size to memset()
|
2014-12-29 19:01:29 +08:00 |
|
Hao Chen
|
3202fed285
|
update README.md
|
2014-12-25 11:28:57 +08:00 |
|
Hao Chen
|
2bcb2490c6
|
New Problem "Two Sum II - Input array is sorted"
|
2014-12-25 10:37:43 +08:00 |
|
Hao Chen
|
9aa233f795
|
New Problem "Majority Element"
|
2014-12-25 10:26:46 +08:00 |
|
Hao Chen
|
9fa4e3f93c
|
New Problem "Excel Sheet Column Title"
|
2014-12-25 09:55:43 +08:00 |
|
Hao Chen
|
658c790751
|
typo fixes
|
2014-12-17 14:08:08 +08:00 |
|
Hao Chen
|
846045ca37
|
update the new better solution for "Fraction to Recurring Decimal"
|
2014-12-17 14:04:34 +08:00 |
|
Hao Chen
|
c2484724ce
|
new problems
|
2014-12-17 00:36:02 +08:00 |
|
Hao Chen
|
ebaeddfd1a
|
New Problem - "Maximum Gap "
|
2014-12-17 00:29:54 +08:00 |
|
Hao Chen
|
e788521188
|
New Problem - "Fraction to Recurring Decimal"
|
2014-12-16 22:58:13 +08:00 |
|
Hao Chen
|
0841287dc5
|
New Problem - "Compare Version Numbers"
|
2014-12-16 18:17:59 +08:00 |
|
Hao Chen
|
aeb53c3abd
|
Add notes for "heart" mark in readme
|
2014-12-11 23:38:37 +08:00 |
|
Hao Chen
|
50e3bc3459
|
new problem "Missing Ranges"
|
2014-12-11 23:33:45 +08:00 |
|
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 |
|