[leetcode] 27. Remove Element
来源:互联网 发布:西装裤配什么鞋子知乎 编辑:程序博客网 时间:2024/06/10 09:16
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.
解法一:
遇到相同val,删除element,并改变iterator和vector长度。
class Solution {public: int removeElement(vector<int>& nums, int val) { int ret = nums.size(); for(int i = 0; i < ret; i++){ if (nums[i]==val){ nums.erase(nums.begin()+i); --ret; --i; } } return ret; }};
0 0
- [LeetCode]27.Remove Element
- LeetCode --- 27. Remove Element
- LeetCode 27.Remove Element
- [Leetcode] 27. Remove Element
- [Leetcode] 27.Remove Element
- 【leetcode】27. Remove Element
- 【leetcode】27. Remove Element
- Leetcode 27. Remove Element
- LeetCode 27. Remove Element
- 27. Remove Element LeetCode
- 【LeetCode】27. Remove Element
- leetcode 27. Remove Element
- leetcode 27. Remove Element
- [LeetCode]27. Remove Element
- LeetCode 27. Remove Element
- [leetcode] 27. Remove Element
- [leetcode] 27. Remove Element
- leetcode 27. Remove Element
- 1061. Dating (20)
- java中的匿名内部类总结
- Linux的SOCKET编程详解
- Ehcache使用
- Android Studio修改项目编译版本
- [leetcode] 27. Remove Element
- Android AllView使用效果
- GP学习(七)—Accessing raster workspaces
- Android 自定义Toast
- JS模块化
- 通达OA列表控件添加js代码,实现js的获取和赋值
- Java JVM:内存溢出(栈溢出,堆溢出,持久代溢出以及 nable to create native thread)
- tips.js提示框插件
- 【杭电】[1865]1sting