Leetcode 268. Missing Number

来源:互联网 发布:淘宝uv pv 编辑:程序博客网 时间:2024/06/07 03:02

Reference.

public class Solution {    public int missingNumber(int[] nums) {        int diff = 0;        for (int i=0; i<nums.length; i++)            diff += nums[i]-i;        return nums.length - diff;    }}


0 0
原创粉丝点击