배열 삭제 요소

1934 단어 데이터 구조
Leetcode 27. Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
Example: Given input array nums =  [3,2,2,3] , val =  3
Your function should return length = 2, with the first two elements of nums being 2.
class Solution {
public:
    int removeElement(vector& nums, int val) {
        int count = 0;
        for (int i = 0; i < nums.size(); i++)
        {
            if (nums[i] != val)
                nums[count++] = nums[i];
        }
        return count;
    }
};

diss 1 위 사 고 를 참고 하 세 요. 방법 이 아주 교묘 합 니 다. 옮 겨 다 니 는 동시에 새로운 배열 생 성 을 완 성 했 습 니 다. 처음 알 았 습 니 다.
Leetcode 26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example, Given input array nums =  [1,1,2] ,
Your function should return length =  2 , with the first two elements of nums being  1  and  2  respectively. It doesn't matter what you leave beyond the new length.
class Solution {
public:
    int removeDuplicates(vector& nums) 
    {
        if (nums.size() < 2) 
            return nums.size();
        int count = 1;
        for (int i = 1; i < nums.size(); i++)
        {
            if (nums[i] != nums[i - 1])
                nums[count++] = nums[i];
        }
        return count;
    }
};

좋은 웹페이지 즐겨찾기