LeetCode 27:Remove Element
来源:互联网 发布:22级战舰升级数据 编辑:程序博客网 时间:2024/06/06 09:06
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.
方法一:
#include<iostream>#include<vector>#include<stack>using namespace std;//利用栈的方法class Solution{public:int removeElement(vector<int>& nums, int val){stack<int> stack1;int n = nums.size();if (n == 0) return 0;for (int i = 0; i < n; i++){if (nums[i] != val){stack1.push(nums[i]);}else{continue;}}int n2 = stack1.size();for (int j = n2-1; j >=0; j--){nums[j] = stack1.top();stack1.pop();}return n2;}};int main(){Solution sol;vector<int> nums1 = { 1, 2, 3,3, 4, 5 };int n1 = sol.removeElement(nums1,3);cout << n1 << endl;for (int i = 0; i < n1; ++i){cout << nums1[i] << ',';}system("pause");return 0;}
方法二:
//利用一个变量index和数组的下标i同时从数组起始位置遍历,当nums[i]!=val时,将nums[i]赋值给nums[index],//若nums[i]=val,则不进行任何操作,跳过往后面继续遍历class Solution{public:int removeElement(vector<int>& nums, int val){int n = nums.size();int index = 0;for (int i = 0; i < n; ++i){if (nums[i] != val){nums[index++] = nums[i];}}return index;}};
1 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
- 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 power of two
- spring security 自定义登陆 - AJAX
- 对用户定义的完整性的认识
- 计算机经典书籍
- C++ 形参与实参的传递
- LeetCode 27:Remove Element
- 汇编中定义数组与变量
- Arch linux 安装教程(2015.11.01)
- [转]F5负载均衡环境下某应用故障分析案例
- Dialog使用总结
- Julia: h5write ,h5read 与ASCIIString、Float64及效率比较
- Oracle学习笔记1
- 实现一段字符串中部分内容字体颜色大小变化
- 对触发器的认识