力扣【简单级别】2

2019.9.19

977.有序数组的平方

public static int[] sortedSquares(int[] A) {
    int[] a = new int[A.length];
    int right = 0;
	//找到负数和非负数的分解
    while (right <= A.length - 1 && A[right] < 0){
        right++;
    }
    int left = right - 1;
    int index = 0;
    //向左向右对比各自的绝对值
    while(left >= 0 && right <= A.length - 1){
        if(Math.abs(A[left]) <= Math.abs(A[right])){
            a[index++] = (int)Math.pow(A[left--],2);
        }else if(Math.abs(A[left]) > Math.abs(A[right])){
            a[index++] = (int)Math.pow(A[right++],2);
        }
    }
    //添加剩余的
    if(left < 0){
        while(right <= A.length - 1){
            a[index++] = (int)Math.pow(A[right++],2);
        }
    }
    if(right > A.length - 1){
        while(left >= 0){
            a[index++] = (int)Math.pow(A[left--],2);
        }
    }
    return a;
}

88.合并两个有序数组

public void merge(int[] nums1, int m, int[] nums2, int n) {
    int index = m + n - 1;
    //从nums1的尾巴开始填充，比较两个数组更大的那个
    while(m >= 1 && n >= 1){
        if(nums1[m-1] >= nums2[n-1]){
            nums1[index--] = nums1[--m];
        }else if(nums1[m-1] < nums2[n-1]){
            nums1[index--] = nums2[--n];
        }
    }
    if(m < 1){
        while(n >= 1){
            nums1[index--] = nums2[--n];
        }
    }
}

21.合并两个有序链表（妈呀，边界调了我好久）

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    if(l1 == null) return l2;
    if(l2 == null) return l1;
    ListNode pre = new ListNode(0);
    ListNode l = pre;
    while(l1 != null && l2 != null){
        if(l1.val <= l2.val){
            pre.next = l1;
            pre = pre.next;
            l1 = l1.next;
        }else{
            pre.next = l2;
            pre = pre.next;
            l2 = l2.next;
        }
    }
    if(l1 == null) pre.next = l2;
    if(l2 == null) pre.next = l1;
    return l.next;
}

942.增减字符串匹配

public int[] diStringMatch(String S) {
    int[] A = new int[S.length()+1];
    int Iindex = 0;
    int Dindex = S.length();
    for(int i = 0; i < S.length(); i++){
        if(S.charAt(i) == 'I'){
            A[i] = Iindex++;
        }else {
            A[i] = Dindex--;
        }
    }
    A[S.length()] = Iindex;
    return A;  
}

728.自除数

public List<Integer> selfDividingNumbers(int left, int right) {
    List<Integer> res = new ArrayList<>();
    for(int i = left; i <= right; i++){
        if(divideSelf(i)) res.add(i);
    }
    return res;
}
//判断是否是自除数
private boolean divideSelf(int i){
    int I = i;
    while(i > 0){
        if(i % 10 == 0 || I % (i % 10) != 0) return false;
        i = i / 10;
    }
    return true;
}