丢失的数字
解法一:数组遍历
public class LeetCode_268 {
public static int missingNumber(int[] nums) {
int n = nums.length;
int sum = n * (n + 1) / 2;
for (int num : nums) {
sum -= num;
}
return sum;
}
public static void main(String[] args) {
int[] nums = new int[]{9, 6, 4, 2, 3, 5, 7, 0, 1};
System.out.println(missingNumber(nums));
}
}