比較巧妙的思路：

https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/solution/yuan-di-zhi-huan-shi-jian-kong-jian-100-by-derrick/

執(zhí)行用時 :2749 ms, 在所有?Java?提交中擊敗了5.01%的用戶

內(nèi)存消耗 :48 MB, 在所有?Java?提交中擊敗了100.00%的用戶

class?Solution?{

????public?int?findRepeatNumber(int[]?nums)?{

????????for(int?temp?:?nums){

????????????int?count?=?0;

????????????for(int?temp2:nums){

????????????????if(temp?==?temp2){

????????????????????count++;

????????????????}

????????????????if(count?>1){

????????????????????return?temp;

????????????????}

????????????}

????????}

????????return?-1;

????}

}