反正这个题不难，lowbit，位运算

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param array int整型一维数组 
     * @return int整型一维数组
     */
    public int[] FindNumsAppearOnce (int[] array) {
        // write code here
        int res = 0;
        for (int i = 0; i < array.length; i ++ ) res ^= array[i];
        res = res & -res;
        int a = 0, b = 0;
        for (int i = 0; i < array.length; i ++ ) {
            if ((array[i] & res) == 0) a ^= array[i];
            else b ^=array[i];
        }
        return a < b? new int[]{a, b}: new int[]{b, a};
    }
}