LeetCode-27. 移除元素(Remove Element)

双指针(击败100%!)
第二个击败100%

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int i = -1;
        if(nums.size() == 0){
        	return 0;
        }
        for (int j = 0; j < nums.size(); ++j)
        {
        	if(nums[j] != val) {
        		nums[++i] = nums[j]; 
        	}
        }
        return i + 1;
    }
};

题目链接:https://leetcode-cn.com/problems/remove-element/

发布了42 篇原创文章 · 获赞 2 · 访问量 1410

猜你喜欢

转载自blog.csdn.net/Listen_heart/article/details/103109015