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

[10/23] 645. Set Mismatch

컨텐츠 정보

본문

Easy
3265763Add to ListShare

You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.

You are given an integer array nums representing the data status of this set after the error.

Find the number that occurs twice and the number that is missing and return them in the form of an array.

 

Example 1:

Input: nums = [1,2,2,4]
Output: [2,3]

Example 2:

Input: nums = [1,1]
Output: [1,2]

 

Constraints:

  • 2 <= nums.length <= 104
  • 1 <= nums[i] <= 104
Accepted
246,768
Submissions
574,220

관련자료

댓글 0
등록된 댓글이 없습니다.
전체 404 / 1 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


알림 0