【leetcode】268. Missing Number

标签：

/**
 *   @author           johnsondu
 *   @time             2015.8.26 23:35
 *   @problem          Missing Number(from leetcode)
 *   @timeComplexity   O(n)
 *   @spaceComplexity  O(1)
 *   @strategy         from index 0 to numofSize(nums), 
 *                   plus i and subtract the number in the vector
 * 
 */

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        int cnt = 0;
        int len = nums.size();
        if(len == 0) return 0;
        
        for(int i = 0; i < len; i ++)
            cnt += i - nums[i];
        cnt += len;
        return cnt;
    }
};

【leetcode】268. Missing Number

标签：

原文地址：http://blog.csdn.net/zone_programming/article/details/48014985