Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3] return 2.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
1 class Solution { 2 //无序数组 3 public: 4 int missingNumber(vector<int>& nums) { 5 sort(nums.begin(),nums.end()); 6 7 int i; 8 for(i=0;i<nums.size();i++) 9 { 10 if(nums[i]!=i) 11 { 12 return i; 13 } 14 else continue; 15 } 16 return i; 17 18 } 19 };
原文：http://www.cnblogs.com/xiaoying1245970347/p/4767943.html