leetcode--27. Remove Element
2016-12-19 21:30
381 查看
Remove Element
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.
和 val 相同的值用数组中最后一个元素代替。
Description
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 pos = 0; for(int i = 0; i < nums.size(); ++i){ if(nums[i] != val) nums[pos++] = nums[i]; } return pos; } };
和 val 相同的值用数组中最后一个元素代替。
public class Solution { public int removeElement(int[] nums, int val) { int len = nums.length; for(int i = 0; i < len; ++i){ if(nums[i] == val) nums[i--] = nums[len-- -1]; } return len; } }
相关文章推荐
- leetcode 27 Remove Element
- leetcode 27 Remove Element (C)
- LeetCode-27. Remove Element
- Leetcode----27 Remove Element
- LeetCode 27---Remove Element
- leetcode[27]Remove Element
- leetcode-27 Remove Element
- LeetCode-27-Remove Element(C语言实现)
- 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
- leetcode27: Remove Element