[LeetCode]Missing Number

public class Solution {
    public int missingNumber(int[] nums) {
        int n = 0;
        for (int num : nums) {
            n = Math.max(n, num);
        }
        int result = 0;
        for (int i = 0; i < nums.length; i++) {
            result ^= nums[i];
        }
        for (int i = 0; i <= n; i++) {
            result ^= i;
        }
        if (n == nums.length - 1) {
            return n + 1;
        } else {
            return result;
        }
    }
}