two_one_occuring problem in java
Method 1:
public class j09_two_one_occuring {
static int findOdd(int arr[], int n) {
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < n; j++) {
if (arr[i] == arr[j])
count++;
}
if (count % 2 != 0)
return arr[i];
}
return 0;
}
public static void main(String[] args) {
int arr[] = { 4, 3, 4, 4, 4, 5, 5, 3, 3 }, n = 9;
System.out.println(findOdd(arr, n));
}
}
Method 2 :
public class j09_two_one_occuring {
static int findOdd(int arr[], int n)
{
int res = 0;
for(int i = 0; i < n; i++){
res = res ^ arr[i];
}
return res;
}
public static void main(String[] args) {
int arr[] = { 4, 3, 4, 4, 4, 5, 5, 3, 3 }, n = 9;
System.out.println(findOdd(arr, n));
}
}
Comments
Post a Comment