leetcode刷题 剑指offer 排序

调整数组顺序使得奇数位于偶数前面

题目描述：https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/

解法1：开辟两个额外数组

 public int[] exchange(int[] nums) {
    	List<Integer> oddarr = new ArrayList<Integer>();
    	List<Integer> evenarr = new ArrayList<Integer>();
    	for(int i = 0; i < nums.length; i++) {
    		if(nums[i] % 2 == 0) evenarr.add(nums[i]);
    		else oddarr.add(nums[i]);
    	}
    	int[] res = new int[nums.length];
    	int i = 0;
    	for(; i < oddarr.size(); i++) {
    		res[i] = oddarr.get(i);
    	}
    	for(int j = 0; j < evenarr.size(); j++) {
    		res[i++] = evenarr.get(j); 
    	}
    	return res;
    }

解法2：开辟一个原地数组

/**
     * 开辟额外数组
     * @param nums
     * @return
     */
    public int[] exchange2(int[] nums) {
    	//奇数个数
    	int oddCnt = 0;
    	for(int x : nums) {
    		if(x % 2 != 0) oddCnt++;
    	}
    	int[] copy = nums.clone();
    	int i = 0, j = oddCnt;//j是奇偶分界点
    	for(int num : copy) {
    		if(num % 2 == 1 ) nums[i++] = num;
    		else nums[j++] = num;
    	}
    	return nums;
    }

解法3：采用冒泡排序思想

/**
         * 冒泡排序
     * @param nums
     * @return
     */
    public int[] exchange3(int[] nums) {
    	for(int i = 0; i < nums.length - 1; i++) {
    		for(int j = 0; j < nums.length - 1 - i; j++) {
    			if(nums[j] % 2== 0 && nums[j+1] % 2!=0) {
    				int temp = nums[j];
    				nums[j] = nums[j+1];
    				nums[j+1]=temp;
    			}
    		}
    	}
    	
    	for(int num:nums)
    		System.out.println(num);
    	return nums;
    }

数组中的逆序对

题目描述：https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/

解法1： 归并排序

 public int reversePairs2(int[] nums) {
    	int len = nums.length;
    	if(len < 2) return 0;
    	int[] copy = new int[len];
    	copy = nums.clone();
    	int[] temp = new int[len];
    	return reversePairs(copy, 0, len -1, temp);
    	
    }
    
    private int reversePairs(int[] nums, int left, int right, int[] tmp) {
    	if(left == right) return 0;
    	int mid = left + (right - left)/2;
    	int leftPairs = reversePairs(nums, left, mid, tmp);
    	int rightPairs = reversePairs(nums, mid+ 1, right, tmp);
    	if(nums[mid] <= nums[mid+1]) return leftPairs + rightPairs;
    	int crossPairs = mergeAndCount(nums, left, mid, right, tmp);
    	return crossPairs + rightPairs + leftPairs;
    }
    
    private int mergeAndCount(int[] nums, int left, int mid, int right, int[] tmp) {
    	for(int i = left; i <= right;i ++) tmp[i] = nums[i];
    	int i = left;
    	int j = mid + 1;
    	int count  = 0;
    	for( int k=left; k <= right; k++) {
    		if(i == mid + 1) {
    			nums[k] = tmp[j++];
    		}else if(j == right + 1) {
    			nums[k] = tmp[i++];
    		}else if(tmp[i] <= tmp[j]) {
    			nums[k] = tmp[i++];
    		}else{
    			nums[k]=tmp[j++];
    			count += (mid-i+1);
    		}
    	}
    	return count;
    }

每天都写一写经典的排序算法