leetcode:Merge Sorted Array

来源:互联网 发布:ubuntu matlab java 编辑:程序博客网 时间:2024/06/12 20:27


归并排序

public class Solution {    public void merge(int A[], int m, int B[], int n) {        int[] T = new int[m];                int k = 0;        int i, j;        for(i = 0; i < m; ++i){            T[i] = A[i];        }        for( i = 0, j = 0; i < m && j < n; ){            if(T[i] <=B[j]){                A[k++] = T[i++];            }            else{                A[k++] = B[j++];            }        }        if(i == m){            for(; j < n; ++j){                A[k++] = B[j];            }        }else{            for(; i < m; ++i){                A[k++] = T[i];            }        }    }}


0 0