Missing Number 位运算
|
1 2 3 4 5 6 7 8 9 10 11 |
public int missingNumber(int[] nums) { if(nums.length == 0 || nums == null) return 0; int missing = 0; for(int i = 0; i <= nums.length; i++) missing ^= i; for(int i = 0 ; i < nums.length; i++) { missing ^= nums[i]; } return missing; } |
Leave A Comment