冒泡排序及字符串去重

案例：

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int [] array= {34,78,21,31,-8,-9}; 
		num(array);//冒泡排序
		String var = "woaini";
		charTest(var);//字符串去重
	}
	/**
	 * 字符串去重
	 * @param var
	 */
	private static void charTest(String var) {
		// TODO Auto-generated method stub
		char c[]=var.toCharArray();  //转成字符数组
		int i,j;
		int length=0;		//记录有几个相同的字母
		for(i=0;i<c.length-1;i++) {   //如果有重复的字母就把重复的字母置为0
			for(j=i+1;j<c.length;j++) {
				if(c[i]==c[j] && c[i]!=0 && c[j]!=0) {
					c[j]=0;
					length++;
				}
			}
		}
		Arrays.sort(c);              //排序
		System.out.println("---字符串去重---");
		for(i=length;i<c.length;i++) {   //输出结果
			System.out.print(c[i]);
		}		
	}
	/**
	 * 数组排序-冒泡
	 * @param array
	 */
	private static void num(int[] array) {
		// TODO Auto-generated method stub
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array.length-1; j++) {
				if (array[j] >array[j+1]) {
					int xiao = array[j];
					array[j] = array[j+1];
					array[j+1] = xiao;
				}
			}
		}
		System.out.println("---冒泡排序---");
		for (int i = 0; i < array.length; i++) {
			System.out.println(array[i]);
		}
	}

Q.E.D.