摘要:
int left = 0, right = m * n - 1; int pivotIdx, pivotElement; while (left <= right) { pivotIdx = (left + right) / 2;//中间点 pivotElement = matrix[pivotId 阅读全文
摘要:
class Solution { public int lengthOfLongestSubstring(String s) { int l=1; int change=1; int r=1; char [] q=s.toCharArray();//字符串转换成字符数组 for(int i=0;i< 阅读全文