package Lq_算法練習(xí);
 
import java.util.Scanner;
 
public class Demo_只出現(xiàn)一次的數(shù)字 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.nextLine();
        String[] strArray = str.split(",");
        //鍵盤輸入數(shù)組，數(shù)字之間用","隔開
        int[] nums = new int[strArray.length];
        for(int i=0;i<nums.length;i++) {
            nums[i]=Integer.parseInt(strArray[i]);
            //將strArray[i]轉(zhuǎn)換成整型類型，并賦值給nums[i]
        }
        int result = singleNumber(nums);
        System.out.println("只出現(xiàn)一次的數(shù)字為："+result);
    }
    public static int singleNumber(int[] nums) {
        int singleNumber = 0;
        //增強(qiáng)型for循環(huán),for(類型 變量:數(shù)組),最后輸出的是num
        /*
        相當(dāng)于
        for(int i=0;i<arr.length;i++){
        int num = arr[i];
        ...
        }
        */
        for (int num : nums) {
            singleNumber ^= num;//異或運(yùn)算，轉(zhuǎn)化為二進(jìn)制再進(jìn)行運(yùn)算
            System.out.println("num="+num);
            System.out.println(singleNumber);
        }
        return singleNumber;
    }
}

package Lq_算法練習(xí);
 
import java.util.Scanner;
 
public class Demo_只出現(xiàn)一次的數(shù)字 {
    public static void main(String[] args) {
        int[] array = { 1, 2, 2 };
        System.out.println("只出現(xiàn)一次的數(shù)字為："+singleNumber(array));
 
    }
 
    public static int singleNumber(int[] array) {
        int tmp = 0; // array[0];
//使用簡(jiǎn)單的for循環(huán)
        for (int i = 0; i < array.length; i++) {// for (int i = 1; i < array.length; i++) {//少一次^
            tmp = tmp ^ array[i];
        }
        return tmp;
    }
}