求数组里面仅仅出现一次的数字的个数

O(n)

public class FindOneEle {
	
	public static int find(int[] array) {
		
		String searchStr = "";
		for (int i : array) {
			searchStr += "/" + String.valueOf(i) + "/";
		}
		int sumOfOneEle = 0;
		for (int i : array) {
			String s = String.valueOf(i);
			String temp = searchStr.replace("/" + s + "/", "");
			int count = (searchStr.length() - temp.length()) / (s.length() + 2);
			if (count == 1) {
				sumOfOneEle++;
			}
			searchStr = temp;
		}
		return sumOfOneEle;
	}
	
	

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		int[] in = {23, 14, 11, 23, 45, 111, 24, 24};
		System.out.println(find(in));

	}