leetcode——268——Missing Number
来源：互联网 发布：淘宝评价回复语大全 编辑：程序博客网 时间：2024/06/13 13:45
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(); int expect = (n+1) * n / 2; for(int i = 0; i < n; i ++) expect -= nums[i]; return expect; }}; 0 0
- Missing Number —— Leetcode
- LeetCode——Missing Number
- leetcode——Missing Number
- leetcode——268——Missing Number
- leetcode刷题日记——Missing Number
- Algorithms—268.Missing Number
- 【LeetCode】268 Missing Number
- LeetCode(268)Missing Number
- [leetcode 268]Missing Number
- leetcode 268: Missing Number
- Leetcode #268 Missing Number
- [LeetCode 268] Missing Number
- leetcode 268 Missing Number
- [LeetCode]268 Missing Number
- leetcode 268 : Missing Number
- LeetCode 268 Missing Number
- 【LEETCODE】268-Missing Number
- LeetCode 268: Missing Number
- Springboot+Maven多模块开发 （一）初始化工程（新建第一个web工程）
- 代理模式
- 每日一练-----顺时针旋转矩阵
- java发送邮件
- java利用classloader实现热部署
- leetcode——268——Missing Number
- 计算质数(极速版)
- Memcached学习笔记
- 标准C++中string的使用++
- 由“无法从静态上下文中引用非静态方法”引出的疑问
- ZOJ 3946 Highway Project（最短路）
- SpringData 学习（7）—— 学习 Repository 接口的第 2 个子接口 PagingAndSortingRepository
- Java之Volatile关键字使用
- DP - 传纸条
