LeetCode自己做的题目记录3

989. 数组形式的整数加法

class Solution {
    public List<Integer> addToArrayForm(int[] A, int K) {
        List<Integer> result = new ArrayList<>();
        if (A.length < (K + "").length()) {
            int sum = 0;
            for (int i : A) {
                sum = sum * 10 + i;
            }
            sum += K;
            while (sum != 0) {
                result.add(sum % 10);
                sum /= 10;
            }
            Collections.reverse(result);
            return result;
        }

        boolean flag = false;
        for (int i = A.length - 1; i >= 0; i--) {
            int j = K % 10;
            int sum = A[i] + j;
            if (flag) {
                sum++;
                flag = false;
            }
            if (sum > 9) {
                sum -= 10;
                flag = true;
            }
            result.add(sum);
            K /= 10;
        }
        if (flag) {
            result.add(1);
        }
        Collections.reverse(result);
        return result;
    }
}

977. 有序数组的平方

class Solution {
    public int[] sortedSquares(int[] A) {
        int[] result = new int[A.length];
        for (int i = 0; i < A.length; i++) {
            result[i] = A[i] * A[i];
        }
        Arrays.sort(result);
        return result;
    }
}

985. 查询后的偶数和

class Solution {
    public int[] sumEvenAfterQueries(int[] A, int[][] queries) {
        int[] result = new int[A.length];
        for (int i = 0; i < A.length; i++) {
            A[queries[i][1]] = A[queries[i][1]] + queries[i][0];
            int sum = 0;
            for (int j : A) {
                if (j % 2 == 0) {
                    sum += j;
                }
            }
            result[i] = sum;
        }
        return result;
    }
}

350. 两个数组的交集 II

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        // 1.
        Map<Integer, Integer> map = new HashMap<>(nums1.length);
        for (int num : nums1) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        // 2.
        List<Integer> list = new ArrayList<>();
        for (int num : nums2) {
            if (map.containsKey(num)) {
                list.add(num);
                map.put(num, map.get(num) - 1);
                if (map.get(num) == 0) {
                    map.remove(num);
                }
            }
        }
        // 3. 输出
        int[] res = new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            res[i] = list.get(i);
        }
        return res;
    }
}

674. 最长连续递增序列

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        if (nums.length < 2) {
            return nums.length;
        }
        int k = 1;
        int max = 1;
        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i + 1] > nums[i]) {
                k++;
                max = Math.max(max, k);
            } else {
                k = 1;
            }
        }
        return max;
    }
}

970. 强整数

class Solution {
    public List<Integer> powerfulIntegers(int x, int y, int bound) {
        List<Integer> r = new ArrayList<>();
        for (int i = 0; i < 20; i++) {
            int num1 = (int)Math.pow(x, i);
            for (int j = 0; j < 20; j++) {
                int num2 = (int)Math.pow(y, j);
                if (num1 + num2 <= bound) {
                    if (!r.contains(num1 + num2)) {
                        r.add(num1 + num2);
                    }
                } else {
                    break;
                }
            }
            if (num1 > bound) {
                break;
            }
        }
        Collections.sort(r);
        return r;
    }
}

125. 验证回文串

class Solution {
    public boolean isPalindrome(String s) {
        s = s.toLowerCase();
        StringBuilder sb = new StringBuilder();
        for (char c : s.toCharArray()) {
            if ((c > 96 && c < 123) || (c > 47 && c < 58)) {
                sb.append(c);
            }
        }
        return sb.toString().equals(sb.reverse().toString());
    }
}

692. 前K个高频单词

class Solution {
    public List<String> topKFrequent(String[] words, int k) {
        Map<String, Integer> map = new HashMap<>(words.length);
        for (String word : words) {
            map.put(word, map.getOrDefault(word, 0) + 1);
        }
        List<String> l = map.entrySet().stream().sorted((e1, e2) -> e2.getKey().compareTo(e1.getKey()))
            .sorted((e1, e2) -> Integer.compare(e1.getValue(), e2.getValue())).map(e -> e.getKey())
            .collect(Collectors.toList());
        Collections.reverse(l);

        return l.subList(0, k);
    }
}

82. 删除排序链表中的重复元素 II

class Solution {
    private List<Integer> l1 = new ArrayList<>();
    private List<Integer> l2 = new ArrayList<>();

    public ListNode deleteDuplicates(ListNode head) {
        setList(head);
        l1.removeAll(l2);
        if (l1.size() == 0) {
            return null;
        }
        ListNode listNode = new ListNode(l1.get(0));
        setNode(listNode, 1);
        return listNode;
    }

    private void setList(ListNode node) {
        if (node != null) {
            int val = node.val;
            if (l1.contains(val)) {
                l2.add(val);
            } else {
                l1.add(val);
            }
            setList(node.next);
        }
    }

    private void setNode(ListNode node, int index) {
        if (index < l1.size()) {
            node.next = new ListNode(l1.get(index));
            setNode(node.next, index + 1);
        }
    }
}

459. 重复的子字符串

class Solution {
    public boolean repeatedSubstringPattern(String s) {
        String s2 = s;
        int size = s.length() / 2;
        for (int i = 0; i < size; i++) {
            char c = s2.charAt(s2.length() - 1);
            s2 = c + s2.substring(0, s2.length() - 1);
            if (s.equals(s2)) {
                return true;
            }
        }
        return false;
    }
}

28. 实现strStr()

class Solution {
    public int strStr(String haystack, String needle) {
        return haystack.indexOf(needle);
    }
}

692. 前K个高频单词

class Solution {
    public List<String> topKFrequent(String[] words, int k) {
        Map<String, Integer> map = new HashMap<>(words.length);
        for (String word : words) {
            map.put(word, map.getOrDefault(word, 0) + 1);
        }
        List<String> l = map.entrySet().stream().sorted((e1, e2) -> e2.getKey().compareTo(e1.getKey()))
            .sorted((e1, e2) -> Integer.compare(e1.getValue(), e2.getValue())).map(e -> e.getKey())
            .collect(Collectors.toList());
        Collections.reverse(l);

        return l.subList(0, k);
    }
}

66. 加一

class Solution {
    public int[] plusOne(int[] digits) {
        List<Integer> list = new ArrayList<>();
        boolean flag = false;
        for (int i = digits.length - 1; i >= 0; i--) {
            int sum = digits[i];
            if (flag) {
                sum++;
                flag = false;
            }
            if (i == digits.length - 1) {
                sum += 1;
            }
            if (sum > 9) {
                sum -= 10;
                flag = true;
            }
            list.add(sum);
        }
        if (flag) {
            list.add(1);
        }
        int[] r = new int[list.size()];
        int index = 0;
        for (int i = list.size() - 1; i >= 0; i--) {
            r[index++] = list.get(i);
        }
        return r;
    }
}

195. 第十行

# Read from the file file.txt and output the tenth line to stdout.
awk 'NR==10{print $0}' file.txt

172. 阶乘后的零

class Solution {
    public int trailingZeroes(int n) {
        int count = 0;
        for (long i = 5; i <= n; i += 5) {
            long k = i;
            if (k % 5 == 0) {
                while (k % 5 == 0) {
                    k /= 5;
                    count++;
                }
            }
        }
        return count;
    }
}

396. 旋转函数

class Solution {
    public int maxRotateFunction(int[] A) {
        int max = getNumber(A);
        for (int i = 1; i < A.length; i++) {
            int last = A[0];
            System.arraycopy(A, 1, A, 0, A.length - 1);
            A[A.length - 1] = last;
            max = Math.max(max, getNumber(A));
        }
        return max;
    }

    private int getNumber(int[] array) {
        int number = 0;
        for (int i = 1; i < array.length; i++) {
            number += array[i] * i;
        }
        return number;
    }
}

20. 有效的括号

class Solution {
    public boolean isValid(String s) {
        while (true) {
            int length = s.length();
            s = s.replace("()", "").replace("{}", "").replace("[]", "");
            if (s.length() == 0) {
                return true;
            }
            if (s.length() == length) {
                return false;
            }
        }
    }
}

189. 旋转数组

class Solution {
    public void rotate(int[] nums, int k) {
        while (k > nums.length) {
            k -= nums.length;
        }
        int[] lefts = new int[k];
        for (int i = nums.length - k, j = 0; i < nums.length; i++, j++) {
            lefts[j] = nums[i];
        }
        System.arraycopy(nums, 0, nums, k, nums.length - k);
        for (int i = 0; i < lefts.length; i++) {
            nums[i] = lefts[i];
        }
    }
}

926. 将字符串翻转到单调递增

class Solution {
    public int minFlipsMonoIncr(String S) {
        int n = S.length();
        if (n < 2) { return 0; }
        int zero = 0, one = 0;
        for (int i = 0; i < n; i++) {
            if (S.charAt(i) == '1') {
                one = Math.min(zero, one);
                zero += 1;
            } else {
                one = Math.min(zero, one) + 1;
            }
        }
        return Math.min(zero, one);
    }
}

387. 字符串中的第一个唯一字符

class Solution {
    public int firstUniqChar(String s) {
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (s.indexOf(c) == s.lastIndexOf(c)) {
                return i;
            }
        }
        return -1;
    }
}

390. 消除游戏

class Solution {
    public int f(int n) {
        return n == 1 ? 1 : 2 * b(n / 2);
    }

    public int b(int n) {
        if (n == 1) {
            return 1;
        }
        if (n % 2 == 0) {
            return f(n / 2) * 2 - 1;
        } else {
            return 2 * f(n / 2);
        }
    }

    public int lastRemaining(int n) {
        return f(n);
    }
}

441. 排列硬币

class Solution {
    public int arrangeCoins(int n) {
        int count = 0, i = 1;
        while (n > 0) {
            n -= i;
            i++;
            count++;
        }
        if (n < 0) {
            count--;
        }
        return count;
    }
}

754. 到达终点数字

class Solution {
    public int reachNumber(int target) {
        target = Math.abs(target); //处理负值的情况
        int count = 0, sum = 0;
        while (sum < target) {
            count++;
            sum += count;
        }
        if ((sum - target) % 2 != 0) {
            count += (count % 2 == 0 ? 1 : 2);
        }
        return count;
    }
}

234. 回文链表

class Solution {
    private List<Integer> list = new ArrayList<>();

    public boolean isPalindrome(ListNode head) {
        setList(head);
        for (int i = 0; i < list.size() / 2; i++) {
            if (!list.get(i).equals(list.get(list.size() - i - 1))) {
                return false;
            }
        }
        return true;
    }

    private void setList(ListNode node) {
        if (node != null) {
            list.add(node.val);
            setList(node.next);
        }
    }
}

34. 在排序数组中查找元素的第一个和最后一个位置

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int[] r = new int[] {-1, -1};
        String s = Arrays.toString(nums).replace("]", ",").replace("[", " ");
        if (!s.contains(" " + target + ",")) {
            return r;
        }
        int count = 0;
        for (int i = 0; i < nums.length; i++) {
            int n = nums[i];
            if (n == target) {
                if (count == 0) {
                    r[0] = i;
                    count++;
                } else {
                    count++;
                }
            }

            if (count != 0 && n != target) {
                break;
            }
        }
        r[1] = r[0] + count - 1;
        return r;
    }
}

849. 到最近的人的最大距离

class Solution {
    public int maxDistToClosest(int[] seats) {
        int result = 1, count = 0;
        boolean flag = false;
        int len = seats.length - 1;
        for (int i = 0; i <= len; i++) {
            //第一位和最后一位为0要特殊处理
            if ((i == 0 && seats[0] == 0) || (i == len && seats[len] == 0)) {
                flag = true;
            }
            if (seats[i] == 0) {
                count++;
            } else {
                if (flag) {
                    result = Math.max(result, count);
                } else {
                    result = Math.max(result, (count + 1) / 2);
                }
                count = 0;
                flag = false;
            }
        }
        if (flag) {
            result = Math.max(result, count);
        }
        return result;
    }
}

141. 环形链表

public class Solution {
    private List<ListNode> l = new ArrayList<>();
    private boolean flag = false;

    public boolean hasCycle(ListNode head) {
        isCycle(head);
        return flag;
    }

    private void isCycle(ListNode node) {
        if (node != null) {
            if (l.contains(node)) {
                flag = true;
                return;
            }
            l.add(node);
            isCycle(node.next);

        }

    }
}

376. 摆动序列

class Solution {
    public int wiggleMaxLength(int[] nums) {
        int n = nums.length;
        if (n < 2) {
            return n;
        }
        int up = 1;
        int down = 1;
        for (int i = 1; i < n; i++) {
            if (nums[i] > nums[i - 1]) {
                up = down + 1;
            }
            if (nums[i] < nums[i - 1]) {
                down = up + 1;
            }
        }
        return Math.max(up, down);
    }
}

645. 错误的集合

class Solution {
    public int[] findErrorNums(int[] nums) {
        int[] r = new int[2];
        Arrays.sort(nums);
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] - nums[i - 1] == 0) {
                r[0] = nums[i];
            }
            if (nums[i] - nums[i - 1] == 2) {
                r[1] = nums[i] - 1;
            }
        }
        if (r[1] == 0) {
            r[1] = nums[0] != 1 ? 1 : nums.length;
        }
        return r;
    }
}

596. 超过5名学生的课

select a.class from(select distinct student,class from courses) a group by class having count(a.class)>4

724. 寻找数组的中心索引

class Solution {
    public int pivotIndex(int[] nums) {
        if (nums.length < 3) {
            return -1;
        }
        int sum = 0, left = 0;
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
        }
        for (int i = 0; i < nums.length; i++) {
            if ((sum - nums[i]) == left * 2) {
                return i;
            }
            left += nums[i];
        }
        return -1;
    }
}

55. 跳跃游戏

class Solution {
    public boolean canJump(int[] nums) {
        int n = 1;
        for (int i = nums.length - 2; i >= 0; i--) {
            if (nums[i] >= n) {
                n = 1;
            } else {
                n++;
            }
            if (i == 0 && n > 1) {
                return false;
            }
        }
        return true;
    }
}

141. 环形链表

public class Solution {
    public boolean hasCycle(ListNode head) {
        List<ListNode> l = new ArrayList<>();
        while(head!=null){
            if(l.contains(head)){
                return true;
            }else{
                l.add(head);
            }
            head = head.next;
        }
        return false;
    }
}

184. 部门工资最高的员工

# Write your MySQL query statement below
select d.name as Department,e.name as Employee,e.Salary 
from Employee e, Department d
where DepartmentId=d.id and e.Salary=
(select max(salary) from Employee where DepartmentId=d.id)

219. 存在重复元素 II

class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[i] == nums[j]) {
                    if (j - i <= k) {
                        return true;
                    }
                    break;
                }
            }
        }
        return false;
    }
}

941. 有效的山脉数组

class Solution {
    public boolean validMountainArray(int[] A) {
        if (A.length < 3 || A[1] < A[0]) {
            return false;
        }
        boolean flag = true;
        for (int i = 0; i < A.length - 1; i++) {
            if (flag) {
                if (A[i + 1] == A[i]) {
                    return false;
                }
                if (A[i + 1] - A[i] < 0) {
                    flag = false;
                }
            } else {
                if (A[i + 1] - A[i] >= 0) {
                    return false;
                }
            }
        }
        if (flag) {
            return false;
        }
        return true;
    }
}

643. 子数组最大平均数 I

class Solution {
    public double findMaxAverage(int[] nums, int k) {
        int max = 0;
        for (int i = 0; i < k; i++) {
            max += nums[i];
        }
        int temp = max;
        for (int i = k; i < nums.length; i++) {
            temp -= nums[i - k];
            temp += nums[i];
            max = Math.max(max, temp);
        }
        return (double)max / k;
    }
}

443. 压缩字符串

class Solution {
    public int compress(char[] chars) {
        char c = chars[0];
        int index = 0, count = 1;
        for (int i = 1; i < chars.length; i++) {
            //如果相等则相加次数,不等就写入
            if (c == chars[i]) {
                count++;
            } else {
                index = getIndex(chars, c, index, count);
                c = chars[i];
                count = 1;
            }
        }

        return getIndex(chars, c, index, count);
    }

    private int getIndex(char[] chars, char c, int index, int count) {
        chars[index++] = c;
        //次数大于1则写入次数
        if (count > 1) {
            char[] cs = (count + "").toCharArray();
            for (char c1 : cs) {
                chars[index++] = c1;
            }
        }
        return index;
    }
}

334. 递增的三元子序列

class Solution {
    public boolean increasingTriplet(int[] nums) {
        if (nums.length < 3) {
            return false;
        }
        for (int i = 0; i <= nums.length - 3; i++) {
            if (nums[i] < nums[i + 1]) {
                int second = nums[i + 1];
                for (int j = i + 1; j <= nums.length - 2; j++) {
                    if (second < nums[j + 1]) { return true; }
                    if (second > nums[j + 1] && nums[i] < nums[j + 1]) { second = nums[j + 1]; }
                }
            }
        }
        return false;
    }
}

19. 删除链表的倒数第N个节点

public class removeNthFromEnd{
    public ListNode removeNthFromEnd(ListNode head, int n) {
        int size = getSize(head, 0);
        //删除第一个
        if (size == n) {
            return head.next;
        }
        //删除中间节点
        removeNode(head, size - n, 1);
        return head;
    }

    private int getSize(ListNode node, int size) {
        if (node != null) {
            return getSize(node.next, size + 1);
        }
        return size;
    }

    private void removeNode(ListNode head, int index, int start) {
        if (index == start) {
            head.next = head.next.next;
            return;
        }
        removeNode(head.next, index, start + 1);
    }

    //快慢指针
    //public ListNode removeNthFromEnd(ListNode head, int n) {
    //    ListNode fast = head, slow = head;
    //    while (n > 0) {
    //        fast = fast.next;
    //        n--;
    //    }
    //    if (fast == null) { return slow.next; }
    //    while (fast.next != null) {
    //        fast = fast.next;
    //        slow = slow.next;
    //    }
    //    slow.next = slow.next.next;
    //    return head;
    //}
}

14. 最长公共前缀

class Solution {
    public String longestCommonPrefix(String[] strs) {
        StringBuilder sb = new StringBuilder();
        int i = 0;
        while (true) {
            char c;
            try {
                c = strs[0].charAt(i);
                for (int j = 1; j < strs.length; j++) {
                    if (strs[j].charAt(i) != c) {
                        return sb.toString();
                    }
                }
            } catch (Exception e) {
                return sb.toString();
            }
            sb.append(c);
            i++;
        }
    }
}

152. 乘积最大子序列

class Solution {
    public int maxProduct(int[] nums) {
        //一个保存最大的，一个保存最小的。
        int max = Integer.MIN_VALUE, imax = 1, imin = 1; 
        for(int i=0; i<nums.length; i++){
            //如果数组的数是负数，那么会导致最大的变最小的，最小的变最大的。因此交换两个的值。
            if(nums[i] < 0){ int tmp = imax; imax = imin; imin = tmp;} 
            imax = Math.max(imax*nums[i], nums[i]);
            imin = Math.min(imin*nums[i], nums[i]);
            
            max = Math.max(max, imax);
        }
        return max;
    }
}

819. 最常见的单词

class Solution {
    public String mostCommonWord(String paragraph, String[] banned) {
        String[] s = paragraph.toLowerCase().replaceAll("[!?',;.]", " ").split("\\s+");
        Map<String, Integer> map = new HashMap<>();
        for (String s1 : s) {
            map.put(s1, map.getOrDefault(s1, 0) + 1);
        }
        List<String> l = map.entrySet().stream().sorted((e1, e2) -> e2.getValue().compareTo(e1.getValue()))
            .map(e -> e.getKey()).collect(Collectors.toList());
        if (banned.length == 0) {
            return l.get(0);
        }
        List<String> list = new ArrayList<>(Arrays.asList(banned));
        for (String s1 : l) {
            if (list.contains(s1)) {
                continue;
            }
            return s1;
        }
        return "";
    }
}

7. 整数反转

class Solution {
    public int reverse(int x) {
        boolean flag = false;
        if (x < 0) {
            flag = true;
            x = 0 - x;
        }

        int i = 0;
        try {
            i = Integer.parseInt(new StringBuilder(x + "").reverse().toString());
        } catch (NumberFormatException e) {
            return i;
        }
        return flag ? 0 - i : i;
    }
}

581. 最短无序连续子数组

class Solution {
    public int findUnsortedSubarray(int[] nums) {
        int[] n = Arrays.stream(nums).sorted().toArray();
        for (int i = 0, j = nums.length - 1; i < nums.length; ) {
            if (n[i] != nums[i] && n[j] != nums[j]) {
                return j - i + 1;
            }
            if (n[i] == nums[i]) {
                i++;
            }
            if (n[j] == nums[j]) {
                j--;
            }
        }
        return 0;
    }
}

848. 字母移位

class Solution {
    public String shiftingLetters(String S, int[] shifts) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < shifts.length; i++) {
            int sum = shifts[i] % 26;
            for (int j = i + 1; j < shifts.length; j++) {
                sum += shifts[j] % 26;
            }
            shifts[i] = sum % 26;
        }
        char[] cs = S.toCharArray();
        for (int i = 0; i < cs.length; i++) {
            char c = cs[i];
            if (shifts.length > i) {
                int num = shifts[i];
                if (c + num > 122) {
                    c = (char)(c - 26 + num);
                } else {
                    c += num;
                }
            }
            sb.append(c);
        }
        return sb.toString();
    }
}

532. 数组中的K-diff数对

class Solution {
    public int findPairs(int[] nums, int k) {
        int count = 0;
        int last = Integer.MIN_VALUE;
        Arrays.sort(nums);
        for (int i = 0; i < nums.length; i++) {
            int n = nums[i];
            if (last == n) {
                continue;
            }
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[j] - n == k) {
                    count++;
                    break;
                }
            }
            last = n;
        }
        return count;
    }
}

414. 第三大的数

class Solution {
    public int thirdMax(int[] nums) {
        Arrays.sort(nums);
        if (nums.length < 3) {
            return nums[nums.length - 1];
        }
        int count = 1;
        for (int i = nums.length - 2; i >= 0; i--) {
            if (nums[i] != nums[i + 1]) {
                count++;
            }
            if (count == 3) {
                return nums[i];
            }
        }
        if (count < 3) {
            return nums[nums.length - 1];
        }
        return 0;
    }
}

168. Excel表列名称

class Solution {
    public String convertToTitle(int n) {
        char[] index = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S',
            'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
        StringBuilder sb = new StringBuilder();
        while (n != 0) {
            if (n % 26 == 0) {
                sb.insert(0, index[25]);
                n = n / 26 - 1;
            } else {
                sb.insert(0, index[n % 26 - 1]);
                n /= 26;
            }
        }
        return sb.toString();
    }
}

914.卡牌分组

public class Card {
    public boolean hasGroupsSizeX(int[] deck) {
        if (deck.length < 2) {
            return false;
        }
        Map<Integer, Integer> map = new HashMap<>();
        for (int i : deck) {
            map.put(i, map.getOrDefault(i, 0) + 1);
        }
        if (map.size() == 1) {
            return true;
        }
        Set<Integer> keys = map.keySet();
        int count = -1;
        for (Integer key : keys) {
            Integer target = map.get(key);
            if (target == 1) {
                return false;
            }
            if (count == -1) {
                count = target;
                continue;
            }
            if (count != target) {
                int common = findCommon(count, target);
                if (count % common != 0 || target % common != 0) {
                    return false;
                }
            }
        }
        return true;
    }

    private int findCommon(int n1, int n2) {
        int min = Math.min(n1, n2);
        int k = 2;
        while (k != min) {
            if (n1 % k == 0 && n2 % k == 0) {
                return k;
            }
            k++;
        }
        return min;
    }
}

179. 最大数

class Solution {
    public String largestNumber(int[] nums) {
        StringBuilder sb = new StringBuilder();
        List<String> list = new ArrayList<>();
        for (int num : nums) {
            list.add(num + "");
        }
        list.stream().sorted((y, x) -> (x + y).compareTo(y + x)).forEach(sb::append);
        String s = sb.toString();
        return s.startsWith("0") ? "0" : s;
    }
}

680. 验证回文字符串 Ⅱ

class Solution {
    public boolean validPalindrome(String s) {
        int l = s.length() - 1;
        for (int i = 0, j = l; i <= l; i++, j--) {
            char c1 = s.charAt(i), c2 = s.charAt(j);
            if (c1 != c2) {
                String s1 = s.substring(i, j);
                String s2 = s.substring(i + 1, j + 1);
                String s3 = new StringBuilder(s1).reverse().toString();
                String s4 = new StringBuilder(s2).reverse().toString();
                if (s1.equals(s3) || s2.equals(s4)) {
                    return true;
                } else {
                    return false;
                }
            }

        }
        return true;
    }
}

633. 平方数之和

class Solution {
    public boolean judgeSquareSum(int c) {
        int h = (int)Math.sqrt(c), l = 0;
        while (l <= h) {
            int r = l * l + h * h;
            if (r == c) {
                return true;
            } else if (r > c) {
                h--;
            } else {
                l++;
            }
        }
        return false;
    }
}

278. 第一个错误的版本

/* The isBadVersion API is defined in the parent class VersionControl.
      boolean isBadVersion(int version); */

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        int left = 0, right = n;
        while (left <= right) {
            // 防止left+right溢出
            int mid = left+(right-left)/2;
            if (isBadVersion(mid) == false) {
                left = mid+1;
            } else {
                right = mid-1;
            }
        }
        if (left > right)
            return left;
        else
            return right;
    }
}

434. 字符串中的单词数

class Solution {
    public int countSegments(String s) {
        String[] s1 = s.split(" ");
        int count = 0;
        for (String s2 : s1) {
            if (!s2.equals("")) {
                count++;
            }
        }
        return count;
    }
}

58. 最后一个单词的长度

class Solution {
    public int lengthOfLastWord(String s) {
        String[] s1 = s.split(" ");
        if (s1.length < 1) {
            return 0;
        }
        return s1[s1.length - 1].length();
    }
}

176. 第二高的薪水

select IFNULL((select distinct(Salary) 
from Employee
order by Salary desc
limit 1,1),null) as SecondHighestSalary

3. 无重复字符的最长子串

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int count = 0;
        StringBuilder temp = new StringBuilder();
        for (char c : s.toCharArray()) {
            if (!temp.toString().contains(c + "")) {
                temp.append(c);
            } else {
                temp = new StringBuilder(temp.substring(temp.indexOf(c + "") + 1) + c);
            }
            count = Math.max(count, temp.length());
        }
        return count;
    }
}

686. 重复叠加字符串匹配

class Solution {
    public int repeatedStringMatch(String A, String B) {
        //一个完整的B可能首部用到A的一部分，尾部用到A的一部分，像这样A'[AA....AA]A' , [ ] 内必然<=B的长度，故总长<=2*A+B
        int end = A.length() * 2 + B.length();
        int count = 1;
        StringBuilder temp = new StringBuilder(A);
        while (temp.length() < end) {
            if (temp.toString().contains(B)) {
                return count;
            }
            count++;
            temp.append(A);
        }
        return -1;
    }
}

192. 统计词频

# Read from the file words.txt and output the word frequency list to stdout.
awk '{for(i=1;i<=NF;i++){res[$i]+=1}}END{for(k in res){print k" "res[k]} }' words.txt | sort -nr -k2

605. 种花问题

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        StringBuilder sb = new StringBuilder("0");
        for (int i : flowerbed) {
            sb.append(i);
        }
        sb.append("0");
        String[] split = sb.toString().split("1");
        for (String s : split) {
            n -= (s.length() - 1) / 2;
        }
        return n <= 0;
    }
}

204. 计数质数

class Solution {
    public int countPrimes(int n) {
        boolean[] isPrime = new boolean[n + 1];
        int count = 0;
        for (int i = 2; i < n; i++) {
            if (!isPrime[i]) {
                count++;
                for (int j = i + i; j < n; j += i) {
                    isPrime[j] = true;
                }
            }
        }
        return count;
    }
}

859. 亲密字符串

class Solution {
    public boolean buddyStrings(String A, String B) {
        int l1 = A.length();
        int l2 = B.length();
        if (l1 < 2 || l2 < 2 || l1 != l2) {
            return false;
        }
        //统计不同
        List<Integer> list = new ArrayList<>(l1);
        for (int i = 0; i < l1; i++) {
            int r = A.charAt(i) - B.charAt(i);
            if (r != 0) {
                list.add(r);
            }
        }
        if (list.size() == 2) {
            return (list.get(0) + list.get(1)) == 0;
        }
        if (list.size() == 0) {
            //看有没有出现两次一样的字母的
            for (int i = 0; i < l1; i++) {
                char c = A.charAt(i);
                if (A.indexOf(c) != A.lastIndexOf(c)) {
                    return true;
                }
            }
        }

        return false;
    }
}

365. 水壶问题

class Solution {
    public boolean canMeasureWater(int x, int y, int z) {
        if (z == 0 || x + y == z) {
            return true;
        }
        if (x + y < z) {
            return false;
        }
        if (x > y) {
            int temp = x;
            x = y;
            y = temp;
        }
        if (x == 0) {
            return y == z;
        }
        //寻找最大公约数,辗转相除法
        int val = x;
        while (y % x != 0) {
            val = y % x;
            y = x;
            x = val;
        }
        return z % val == 0;
    }
}

220. 存在重复元素 III

class Solution {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        int l = nums.length - 1;
        for (int i = 0; i <= l; i++) {
            for (int j = i + 1; j <= Math.min(i + k, l); j++) {
                if (Math.abs((long)nums[i] - nums[j]) - t <= 0) {
                    return true;
                }
            }
        }
        return false;
    }
}

---