摘要:
Refer: https://www.hrwhisper.me/leetcode-patching-array/ 就是用known_sum表示已知的连续和为[1,known_sum),有了这个表示那就简单了: nums[i] <= known_sum,更新已知范围为:[1,known_sum + n 阅读全文
摘要:
Refer: https://segmentfault.com/a/1190000003059361 O(n^2) Solution public String shortestPalindrome(String s) { if(s == null || s.length() <= 1) retur 阅读全文