LeetCode解题思路之Remove Element
2017-06-21 00:00
176 查看
##问题描述
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.
在原数组上删除给定的元素,并返回新的数组长度
##代码
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.
在原数组上删除给定的元素,并返回新的数组长度
##代码
int removeElement(int* nums, int numsSize, int val) { int length = 0; for (int index = 0; index < numsSize; index++) { int elementValue = nums[index]; if (elementValue != val) { nums[length++] = elementValue; } } return length; }
相关文章推荐
- leetCode 27.Remove Element (删除元素) 解题思路和方法
- leetCode 27.Remove Element (删除元素) 解题思路和方法
- LeetCode Remove Element 解题报告
- leetCode 19.Remove Nth Node From End of List(删除倒数第n个节点) 解题思路和方法
- leetCode 26.Remove Duplicates from Sorted Array(删除数组反复点) 解题思路和方法
- 【LeetCode】27.Remove Element解题报告
- 【LeetCode】27.Remove Element(Easy)解题报告
- LeetCode解题思路之Remove Duplicates from Sorted Array
- 【LeetCode】27.Remove Element(Easy)解题报告
- [LeetCode] 230. Kth Smallest Element in a BST 解题思路
- leetCode 26.Remove Duplicates from Sorted Array(删除数组重复点) 解题思路和方法
- LeetCode Weekly Contest 26解题思路
- [Leetcode] 229. Majority Element II 解题报告
- leetcode 27. Remove Element移出元素(双指针)
- Leetcode_remove-element
- 547. Friend Circles | LeetCode 解题思路
- leetcode部分解题思路
- LeetCode 2 Remove Element
- LeetCode-Kth Smallest Element in a BST-解题报告
- LeetCode-Majority Element -解题报告