엔지니어 게시판
LeetCode 솔루션 분류

[5/28] 268. Missing Number

컨텐츠 정보

본문

Easy
61032879Add to ListShare

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

 

Example 1:

Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.

Example 2:

Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.

Example 3:

Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.

 

Constraints:

  • n == nums.length
  • 1 <= n <= 104
  • 0 <= nums[i] <= n
  • All the numbers of nums are unique.

 

Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

관련자료

댓글 2

mingki님의 댓글

  • 익명
  • 작성일
C++
Runtime: 30 ms, faster than 40.25% of C++ online submissions for Missing Number.
Memory Usage: 18 MB, less than 65.00% of C++ online submissions for Missing Number.
class Solution {
public:
    int missingNumber(vector<int>& nums) {
        int n = nums.size();
        int res = n;
        for (int i = 0; i < n; ++i) {
            res += i - nums[i];
        }
        return res;
    }
};

Coffee님의 댓글

  • 익명
  • 작성일
class Solution {
    public int missingNumber(int[] nums) {
        
        int result = nums[nums.length-1];
        int lumpSum = 0;
        for(int i : nums){
            lumpSum += i;
        }
        
        int length = nums.length;
        
        result = ((length * (length+1)) / 2) - lumpSum;
        
        return result;
        
    }
}
전체 94 / 3 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 699 명
  • 오늘 방문자 4,009 명
  • 어제 방문자 7,431 명
  • 최대 방문자 14,831 명
  • 전체 회원수 1,542 명
알림 0