leetcode 268. Missing Number

原地哈希。代码没怎么优化，思路清晰。

    int missingNumber(vector<int>& nums) {int size = nums.size();for (int i = 0; i < size; i++) {if (nums[i] != -1) {if (nums[i] == size) {nums.push_back(size);nums[i] = -1;}else if (i != nums[i]) {swap(nums[i], nums[nums[i]]);i--;  // 不前进的意思，由于上面i++}}}if (nums.size() != size + 1)return size;for (int i = 0; i <= size; i++)if (i != nums[i])return i;}

转载于:https://www.cnblogs.com/willaty/p/8430187.html

leetcode 268. Missing Number相关推荐

LeetCode 268. Missing Number--Python解法--数学题
LeetCode 268. Missing Number–Python解法–数学题 LeetCode题解专栏:LeetCode题解 LeetCode 所有题目总结:LeetCode 所有题目总结大部 ...
268. Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missin ...
268. Missing Number(缺失数字)
题目地址:https://leetcode.com/problems/missing-number/description/ Given an array containing n distinct ...
Leet Code OJ 268. Missing Number [Difficulty: Medium]
题目: Given an array containing n distinct numbers taken from 0, 1, 2, -, n, find the one that is miss ...
LeetCode之Missing Number
1.题目 Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is m ...
268 missing number
问题:给定一个包含n个不同数字的数组,从0开始,例如0,1,2,-n.找到数组中缺了那个数字.例如输入nums=[0,1,3],输出2. 思路:高斯从0到n的和为sum=(1+n)*n/2.只要计算 ...
PAT甲级1144 The Missing Number：[C++题解]哈希表
文章目录题目分析题目链接题目分析来源:acwing 分析: 把所有的数放进一个hash表,然后从1开始遍历,看每个数是不是在hash表中,输出第一个不在表中的元素. ac代码 #include ...
LeetCode：Largest Number - 求整型数组中各元素可拼合成的最大数字
2019独角兽企业重金招聘Python工程师标准>>> 1.题目名称 Largest Number(求整型数组中各元素可拼合成的最大数字) 2.题目地址 https://leetco ...
【整数转字符串】LeetCode 9. Palindrome Number
LeetCode 9. Palindrome Number Solution1: 不利用字符串 class Solution { public:bool isPalindrome(int x) {if ...

leetcode 268. Missing Number

leetcode 268. Missing Number相关推荐

最新文章

热门文章