LeetCode 27. Remove Element
2016-02-05 15:52
387 查看
按道理是很简单的题目，遍历一次，删除相关value即可，看tag说是two points，还是不造怎么用这个做。
普通的代码如下：
class Solution {
public:
int removeElement(vector<int>& nums, int val)
{
vector<int>::iterator iter = nums.begin();
while (iter != nums.end())
{
if (*iter == val)
{
nums.erase(iter);
}
else
{
++iter;
}
}
return nums.size();
}
};
普通的代码如下：
class Solution {
public:
int removeElement(vector<int>& nums, int val)
{
vector<int>::iterator iter = nums.begin();
while (iter != nums.end())
{
if (*iter == val)
{
nums.erase(iter);
}
else
{
++iter;
}
}
return nums.size();
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解