题目链接:LeetCode 268—Missing Number
找寻顺序序列中缺少的那个数,代码如下:
public class Problem268 {
public static void main(String[] args) {
// TODO Auto-generated method stub
}
public int missingNumber(int[] nums) {
int x=nums.length;
x=nums.length*(nums.length+1)/2;
for(int i=0;i<nums.length;i++)
x-=nums[i];
return x;
}
}