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?
class Solution {
public:
int missingNumber(vector<int>& nums) {
int n = nums.size();
return (1 + n) * n / 2 - accumulate(nums.begin(), nums.end(), 0);
}
};
D114 268. Missing Number 题目链接 268. Missing Number 题目分析 给定...
LeetCode 268. Missing Number Description Given an array c...
题目：268. Missing Number Given an array containing n distin...
268. Missing Number Total Accepted: 60895Total Submission...
https://leetcode.com/problems/missing-number/description/...
Problem Given an array containing n distinct numbers take...
想法就是扫一遍，如果遇到nums[i] == len(nums)说名缺失的数字在中间，就在列表最后添加nums[i...
题目分析 题目链接，登录 LeetCode 后可用这道题是给一个长度为 n 的数组，这个数组本来应该存 0 到 n...
1.描述 Given an array containing n distinct numbers taken f...
题目：Given an array containing n distinct numbers taken fro...
本文标题：268. Missing Number
本文链接：https://www.haomeiwen.com/subject/irfmpxtx.html
网友评论