OddOccurrencesInArray

점수 : 80 / 20 = 55% ㅡ_ㅡ 

public static int soludtion(int[] A){
        int result = 0;

        int index = 0;
        int searchTarget = 0;

        while(true){
            searchTarget = A[index];
            int dupCnt = 0;
            for(int i = 0; i< A.length; i++){
                if(searchTarget == A[i]){
                    dupCnt++;
                }
            }

            if(dupCnt < 2){
                result = searchTarget;
                break;
            }
            index++;
        }

        return result;
    }