27. Remove Element
来源:互联网 发布:网络互动直播新闻 编辑:程序博客网 时间:2024/06/10 10:20
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<int>& nums, int val) { int cnt = 0; for(int i = 0 ; i < nums.size() ; ++i) { if(nums[i] == val) cnt++;//统计重复的val else nums[i-cnt] = nums[i];//修改nums } return nums.size()-cnt; }};
0 0
- [LeetCode]27.Remove Element
- LeetCode --- 27. Remove Element
- LeetCode 27.Remove Element
- [Leetcode] 27. Remove Element
- 27.Remove Element
- [Leetcode] 27.Remove Element
- 27. Remove Element
- 27. Remove Element
- 【leetcode】27. Remove Element
- 【leetcode】27. Remove Element
- 27. Remove Element
- 27. Remove Element
- 27. Remove Element
- Leetcode 27. Remove Element
- 27. Remove Element
- LeetCode 27. Remove Element
- 27. Remove Element LeetCode
- 27. Remove Element
- jQuery中Ajax
- CodeForces
- 有向图的强连通分量(Tanjan)
- JDBC详解
- windows mysql命令导入数据库报错
- 27. Remove Element
- 集合框架总结2
- js中对象的创建
- Super Washing Machines
- vue-cli生成项目修改之后编译报错
- 在Ubuntu中安装Eclipse与Helloworld
- 什么是Just In Time编译器?
- 165.n1-viewIndicator实现tab
- js中几种实用的跨域方法详解