-
https://github.com/haoel/leetcode/blob/ad62b9d82e8d72a3923881840b23532216c12982/src/rotateList/rotateList.cpp#L35-L36
Given the length n, you only need to loop about n~2n times if k is much more bigg…
ghost updated
9 years ago
-
https://github.com/haoel/leetcode/blob/990d56f06caa955c930e59c793002c2d5358e817/src/distinctSubsequences/distinctSubsequences.cpp#L132
This algorithm failed when there are successive characters in T,…
ghost updated
9 years ago
-
https://github.com/haoel/leetcode/blob/4cda31053dcd42e01fb1bb87cf9f09de55f546e8/src/zigZagConversion/zigZagConversion.cpp#L31
``` cpp
if (nRows >= s.length()) return s;
```
ghost updated
9 years ago
-
https://github.com/haoel/leetcode/blob/master/src/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.cpp
Not worked for this test case
{ 2, 3, 1, 4, 5, 6, 7 }
-
https://github.com/haoel/leetcode/blob/ad62b9d82e8d72a3923881840b23532216c12982/src/countAndSay/countAndSay.cpp#L55
ghost updated
9 years ago
-
Have a look at: https://github.com/haoel/leetcode/blob/master/src/searchInsertPosition/searchInsertPosition.cpp#L28
``` cpp
int mid = low +(high-low)/2;
```
would occur overflow. try to change to th…
-
https://github.com/haoel/leetcode/blob/ad62b9d82e8d72a3923881840b23532216c12982/src/strStr/strStr.cpp#L60
It's confusing that `char* ph` does not move with the same offset as `char* haystack` does.
…
ghost updated
9 years ago
-
-
蒙拿,你这题的code大数据超时呀,O(N^2)的算法复杂度要超时的。
需要O(N)的算法才能过的。
https://github.com/xiongjunliang/leetcode/blob/master/stock3/stock3.cpp
-
每次编译,有很多警告信息:
`** WARNING ** Failed to convert input string to UTF16...`