题目网址:https://leetcode.cn/leetbook/read/top-interview-questions-easy/x21ib6/
public class Solution {
public int SingleNumber(int[] nums) {
int once=0;
if(nums.Length==1){
return nums[0];
}
for(int i=0;i<nums.Length;i++){
for(int j=0;j<nums.Length;j++){
if(nums[i]==nums[j] && i!=j){
break;
}
if(j==(nums.Length-1)){
once=nums[i];
}
}
}
return once;
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/acb2f20175abe0d38c98d81f9180ccc2.png)