268. Missing Number
1. Question: 268. Missing Number
url : https://leetcode.com/problems/missing-number/
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n
, find the one that is missing from the array.
Example 1:
Input: [3,0,1] Output: 2
Example 2:
Input: [9,6,4,2,3,5,7,0,1] Output: 8
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
2. Solution:
class Solution(object): def missingNumber(self, nums): """ :type nums: List[int] :rtype: int """ size = len(nums) for i in range(size): if nums[i] == size: continue while nums[i] != i and nums[i] != size: if nums[nums[i]] == nums[i]: return i nums[nums[i]], nums[i] = nums[i], nums[nums[i]] for i in range(size): if nums[i] != i: return i return size
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步