Java归并排序

leetcode_912排序数组

class Solution {

    int[] temp;

    public int[] sortArray(int[] nums) {
        temp = new int[nums.length];
        sort(nums,0,nums.length-1);
        return nums;
    }

    public void sort(int[] nums,int left,int right){
       
        if(left >= right){
            return;
        }

        int mid = left + (right - left)/2;
        sort(nums,left,mid);
        sort(nums,mid+1,right);

        merge(nums,left,mid,right);
    }
    
    public void merge(int[] nums,int left,int mid,int right){
        for(int i = left;i <= right;i++ ){
            temp[i] = nums[i];
        }

        int i = left,j = mid + 1;
        for(int p = left;p <= right;p++){
            if(i == mid + 1){
                nums[p] = temp[j++];
            }else if(j == right+1){
                nums[p] = temp[i++];
            }else if(temp[i] < temp[j]){
                nums[p] = temp[i++];
            }else if(temp[i] > temp[j]){
                nums[p] = temp[j++];
            }
        }
    }
}

执行用时：10 ms, 在所有 Java 提交中击败了83.18%的用户

内存消耗：50.7 MB, 在所有 Java 提交中击败了44.35%的用户

通过测试用例：13 / 13