27. Remove Element
来源:互联网 发布:甲骨文java培训骗局 编辑:程序博客网 时间:2024/06/05 11:28
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 sum(0);
int num=nums.size();
for(int i=0;i<num;i++)
{
if(nums[i]!=val)
nums[sum++]=nums[i];
}
return sum;
}
};
- [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
- 二维码解码器Zbar+VS2012开发环境配置
- 100. Same Tree
- Java虚拟机解析篇之 -- 内存模型
- CNN Net
- 命令提示OJ Problem 566
- 27. Remove Element
- Map与List查找性能比较
- Opencv+Zbar二维码识别(标准条形码/二维码识别)
- 所以为什么要学ps?
- AngularJS开发WebApp的路由配置
- Windows和linux下的查看网络命令
- PowerMock介绍
- Redis常用命令
- 简单的动态链表