코딩복습장

LeetCode: Remove Element 본문

코딩 테스트/python(파이썬)

LeetCode: Remove Element

코복장 2025. 6. 7. 12:39
728x90

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.

Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things:

  • Change the array nums such that the first k elements of nums contain the elements which are not equal to val. The remaining elements of nums are not important as well as the size of nums.
  • Return k.

Custom Judge:

The judge will test your solution with the following code:

int[] nums = [...]; // Input array
int val = ...; // Value to remove
int[] expectedNums = [...]; // The expected answer with correct length.
                            // It is sorted with no values equaling val.

int k = removeElement(nums, val); // Calls your implementation

assert k == expectedNums.length;
sort(nums, 0, k); // Sort the first k elements of nums
for (int i = 0; i < actualLength; i++) {
    assert nums[i] == expectedNums[i];
}

If all assertions pass, then your solution will be accepted.

 

Example 1:

Input: nums = [3,2,2,3], val = 3
Output: 2, nums = [2,2,_,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 2.
It does not matter what you leave beyond the returned k (hence they are underscores).

Example 2:

Input: nums = [0,1,2,2,3,0,4,2], val = 2
Output: 5, nums = [0,1,4,0,3,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.
Note that the five elements can be returned in any order.
It does not matter what you leave beyond the returned k (hence they are underscores).

 

Constraints:

  • 0 <= nums.length <= 100
  • 0 <= nums[i] <= 50
  • 0 <= val <= 100

이 문제는 리스트에서 요구하는 숫자와 같지 않다면 자리를 앞으로 옮기는 방식을 사용하여 풀면 되는 간단한 문제이다.

 

풀이과정은 다음과 같다. 

 

1. 요구한 숫자와 현재 리스트의 원소가 같은지 확인.

 

2. 다르다면 앞의 요소와 같지 않은 요소를 변환

 

 


구현코드

class Solution(object):
    def removeElement(self, nums, val):
        """
        :type nums: List[int]
        :type val: int
        :rtype: int
        """
        k = 0  # val과 다른 값을 저장할 위치 인덱스
        for i in range(len(nums)):
            if nums[i] != val:
                nums[k] = nums[i]  # val이 아닌 값을 앞으로 옮긴다
                k += 1
        return k
728x90

'코딩 테스트 > python(파이썬)' 카테고리의 다른 글

LeetCode: Binary Tree Preorder Traversal  (2) 2025.06.10
LeetCode: Array Partition  (0) 2025.06.09
백준: 14891번 톱니바퀴  (0) 2025.06.06
LeetCode: Longest Common Prefix  (0) 2025.06.03
LeetCode: Valid Parentheses  (0) 2025.06.03
Comments