面试题，凑14，将数组中相加为14的数去除，并升序排列

<span style="font-size:14px;">package com.codemo;


public class TestCase {

	public static final Integer[] a = new Integer[]{9,9,1,5,7,13};
	public static void main(String[] args) {
		//计算消除的次数
		int count = 0;
		
		for( int i = 0; i < a.length - 1 ; i ++ ){
			for( int j = i + 1; j < a.length ; j ++ ){
				if( (a[i] != null && a[j] != null) &&( a[i] + a[j] == 14) ){
					a[i] = null;
					a[j] = null;
					count++;
				}
				
			}
			
		}
		
		Integer[] tmp = new Integer[a.length - (count * 2)];
		//局部变量
		int c = 0;
		for( Integer i : a ){
			if( i != null )
				tmp[c++] = i;
		}
		
		sort(tmp);

	}
	
	
	//冒泡排序
	public static void sort( Integer[] src ){
		for( int i = 0 ;  i < src.length - 1; i ++ ){
			for( int j = 0; j < src.length - 1 -i ; j++ ){
				if( src[j] > src[j+1]  ){
					Integer tmp = src[j];
					src[j] = src[j+1];				
					src[j+1] = tmp;
				}
			}
		}
		
		
		for( Integer i : src ){
			System.out.print(i+" ");
			
		}
	}

}
</span>