摘要：
用时：2.5min class Solution { public void reverseString(char[] s) { /** 遍历左右指针交换字符 */ int l = 0, r = s.length - 1; while(l < r){ char t = s[l]; s[l] = s[ 阅读全文
摘要：
用时：42min class Solution { public int removeDuplicates(int[] nums) { /** * 双指针，右指针遍历整个数组，左指针记录有效值 */ int l = 0, r = 0; Set<Integer> s = new HashSet<Int 阅读全文