//num1,num2分别为长度为1的数组。传出参数
//将num1[0],num2[0]设置为返回结果
public class Solution{
boolean b_num1 = false;
public void FindNumsAppearOnce(int[] array, int num1[], int num2[]) {
if (array.length == 0) {
return;
}
for (int i = 0; i < array.length; i++) {
boolean flag = true;
for (int j = 0; j < array.length; j++) {
if (array[i] == array[j] && (i != j)) {
flag = false;
break;
}
}
if (flag) {
if (!b_num1) {
num1[0] = array[i];
// 找到第一个
b_num1 = true;
} else {
num2[0] = array[i];
}
}
}
}
}
//将num1[0],num2[0]设置为返回结果
public class Solution{
boolean b_num1 = false;
public void FindNumsAppearOnce(int[] array, int num1[], int num2[]) {
if (array.length == 0) {
return;
}
for (int i = 0; i < array.length; i++) {
boolean flag = true;
for (int j = 0; j < array.length; j++) {
if (array[i] == array[j] && (i != j)) {
flag = false;
break;
}
}
if (flag) {
if (!b_num1) {
num1[0] = array[i];
// 找到第一个
b_num1 = true;
} else {
num2[0] = array[i];
}
}
}
}
}