Saturday, April 16, 2022

Leet Code 136. Single Number

https://leetcode.com/problems/single-number/


Example 1:

Input: nums = [2,2,1]
Output: 1





package pep.Day63;

public class LeetCode_136_Single_Number {
public static void main(String[] args) {
System.out.println(singleNumber(new int[]{2, 2, 1}));
}

public static int singleNumber(int[] nums) {
int ans = 0;

for (int i : nums) {
ans = ans ^ i;
}

return ans;
}
}




No comments:

Post a Comment

Diagonal Traversal

 eg.  1       2       3       4 5      6       7       8 9    10    11     12 13  14   15    16 Output: 1 6 11 16 2 7 12 3 8 4  Approach:...