LeetCode 27. Remove Element
来源:互联网 发布:看看电视剧的软件 编辑:程序博客网 时间:2024/05/17 01:11
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.
// Two pointers.
#include <vector>#include <iostream>using namespace std;int removeElement(vector<int>& nums, int target) { if(nums.size() == 0) return 0; int i = 0; // one pointer. int j = nums.size() - 1; // the other pointer. while(i <= j) { if(nums[i] == target) { swap(nums[i], nums[j]); j--; } else { i++; } } return i;}int main(void) { vector<int> nums; nums.push_back(3); nums.push_back(3); int length = removeElement(nums, 3); cout << length << endl;}
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
- Android AVD创建以及设置各个参数的详解
- LeetCode 189. Rotate Array
- (知识分享)软硬件调试九法:第八条规则 求助他人, 获得全新观点
- ssl家谱 并查集
- HDU 1232 畅通工程 (并差集)
- LeetCode 27. Remove Element
- Linux文件上传工具下载工具及详细使用说明
- Ubuntu 14.04 LTS备份iso镜像
- 按钮点击事件的三种写法
- 深入学习计算机系统(2版)笔记
- WebSocket vs REST
- iOS图片轮播器的使用
- LeetCode 283. Move Zeroes
- 文件I/O编程