合并数组

package perpor.jisuan;

public class PermuteClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int[] array1 = new int[] { 1, 3, 6, 8 };
		int[] array2 = new int[] { 2, 4, 5, 7 };

		printArray(combine(array1,array2));
	}

	public static int[] combine(int[] array1, int[] array2) {
		int[] data = new int[array1.length + array2.length];

		int i = 0;
		int j = 0;

		int length1 = array1.length;
		int length2 = array2.length;

		for (int pos = 0; pos < data.length; pos++) {

			if (length1 > i && length2 > j) {
				int data1 = array1[i];
				int data2 = array2[j];
				if (data1 < data2) {
					data[pos] = array1[i];
					i++;

				} else {
					data[pos] = array2[j];
					j++;
				}
			} else if (length1 == i) {
				data[pos] = array2[j];
				j++;
			} else {
				data[pos] = array1[i];
				i++;
			}

		}
		return data;
	}

	public static void printArray(int[] pData) {
		for (int i = 0; i < pData.length; i++)
			System.out.print(pData[i] + " ");

	}

}