|
摘要：
If result is overflow, then return -1. 1 public class Solution { 2 public int reverse(int x) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 boolean positive = true; 6 if(x 0)11 ... 阅读全文
摘要：
寻找W型字符的规律：除第一和最后一行外都是对称的。找出循环的长度相应的做出位移即可。比较烦 1 public class Solution { 2 public String convert(String s, int nRows) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(nRows == 1) 6 ... 阅读全文
摘要：
从左往右扫描，当遇到重复字母时，以上一个重复字母的index +1，作为新的搜索起始位置。可以减少时间， 但时间复杂度没有变O(n2) 1 public class Solution { 2 public int lengthOfLongestSubstring(String s) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 ... 阅读全文
|
