Leetcode problem 136. 'Single Number'
class Solution {
public int singleNumber(int[] nums) {
int c = 0, a = 0, b = 0;
for(int i = 0; i<nums.length; i++){
for(int j = 0; j<nums.length; j++){
if(nums[i] == nums[j])
c++;
}
if(c==1){
a = 1;
b = nums[i];
break;
}
c=0;
}
if(a == 1)
return b;
else
return 0;
}
}
Comments
Post a Comment