[面试真题] LeetCode:Remove Element
2013-05-13 20:39
501 查看
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.
Run Status: Accepted!
Program Runtime: 20 milli secs
Progress: 112/112 test cases passed.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
class Solution { public: int removeElement(int A[], int n, int elem) { // Start typing your C/C++ solution below // DO NOT write int main() function n--; for(int i=0; i<=n; i++){ if(A[i] == elem){ while(n>i && A == elem){ n--; } A[i] = A ; n--; } } return n+1; } };
Run Status: Accepted!
Program Runtime: 20 milli secs
Progress: 112/112 test cases passed.
相关文章推荐
- [面试真题] LeetCode:Binary Tree Inorder Traversal
- [面试真题] LeetCode:Maximum Depth of Binary Tree
- [面试真题] LeetCode:Construct Binary Tree from Preorder and Inorder Traversal
- [面试真题] LeetCode:Construct Binary Tree from Inorder and Postorder Traversal
- [面试真题] LeetCode:Balanced Binary Tree
- [面试真题] LeetCode:Validate Binary Search Tree
- [面试真题] LeetCode:Minimum Depth of Binary Tree
- [面试真题] LeetCode:Symmetric Tree
- [面试真题] LeetCode:Rotate List
- [面试真题] LeetCode:Same Tree
- [面试真题] LeetCode:Flatten Binary Tree to Linked List
- [面试真题] LeetCode:Remove Nth Node From End of List
- [面试真题] LeetCode:Reverse Linked List II
- 【LeetCode-面试算法经典-Java实现】【027-Remove Element(删除数组中指定的元素)】
- [面试真题] LeetCode:Remove Duplicates from Sorted List I & II
- [面试真题] LeetCode:Longest Common Prefix
- [面试真题] LeetCode:Reverse Integer
- [面试真题] LeetCode:Remove Duplicates from Sorted Array
- [面试真题] LeetCode:Add Two Numbers
- [面试真题] LeetCode:Path Sum