- 博客(3)
- 收藏
- 关注
RSS订阅转载 LeetCode 330 Patching Array
Refer:https://www.hrwhisper.me/leetcode-patching-array/ 就是用known_sum表示已知的连续和为[1,known_sum)，有了这个表示那就简单了： nums[i] <= known_sum，更新已知范围为：[1,known_sum + nums[i] ) nums[i] > known_sum, 添加...
2016-02-15 09:33:00
164
转载 LeetCode 214 Shortest Palindrome (KMP)
Refer:https://segmentfault.com/a/1190000003059361 O(n^2) Solution public String shortestPalindrome(String s) { if(s == null || s.length() <= 1) return s; ...
2016-02-15 08:44:00
155
转载 LeetCode WiggleSort I && II
LeetCode Wiggle Sort I && II public class WiggleSort { /* Wiggle Sort I Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] ...
2016-01-24 13:43:00
122
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人