leetcode之 Remove Element
来源:互联网 发布:淘宝待售宝贝在哪里 编辑:程序博客网 时间:2024/04/29 15:52
题目:
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
解答:
就是两个指针,遇见这个value的时候和后面进行交换,同时移动指针即可
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int size = nums.size();
if(size == 0)
return 0;
int start = 0;
int end = size - 1;
while(start <= end)
{
if(nums[start] == val)
{
nums[start] = nums[end];
nums[end] = val;
end--;
}
else
start++;
}
return start;
}
};
- leetcode之Remove Element
- LeetCode 之 Remove Element
- LeetCode之Remove Element
- LeetCode之Remove Element
- LeetCode之Remove Element
- leetcode之remove element
- 【Leetcode】之Remove Element
- leetcode之 Remove Element
- leetcode之Remove Element
- leetcode之Remove Element
- LeetCode之Remove Element
- leetcode 之Remove Element
- leetcode:数组之Remove Element
- leetcode之路027 Remove Element
- LeetCode进阶之路(Remove Element)
- leetcode解题集锦之 Remove Element
- LeetCode:Remove Element
- LeetCode: Remove Element
- LaTeX 如何使用双引号,单引号
- 【高斯模糊算法的理解】简单易懂
- HDU 1043 Eight(八数码第七境界|A*+哈希+曼哈顿距离)
- 并查集
- leetcode之 Symmetric Tree
- leetcode之 Remove Element
- Android SoundPool播放音频
- java 编程思想第六章个人总结---访问权限控制
- ubuntu 64上的GCC如何编译32位程序
- 【2-6】HDFS读取数据的过程
- [Maven实战](1)安装与配置
- 排序算法的稳定性
- 【BZOJ】3339 - Ⅱ - 变式Ⅰ
- [iOS]关于微信支付