[LeetCode] 084: Remove Element
来源:互联网 发布:点餐系统数据库设计 编辑:程序博客网 时间:2024/06/08 10:32
[Problem]
[Solution]
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.
[Solution]
class Solution {说明:版权所有,转载请注明出处。Coder007的博客
public:
int removeElement(int A[], int n, int elem) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int i = 0, j = 0;
while(j < n){
if(A[j] != elem){
A[i++] = A[j];
}
j++;
}
return i;
}
};
阅读全文
0 0
- [LeetCode] 084: Remove Element
- LeetCode:Remove Element
- LeetCode: Remove Element
- [Leetcode] Remove Element
- LeetCode: Remove Element
- leetcode 39: Remove Element
- [LeetCode] Remove Element
- Leetcode: Remove Element
- Leetcode:Remove Element
- Leetcode:Remove Element
- Leetcode:Remove Element
- [LeetCode]Remove Element
- LeetCode-Remove Element
- LeetCode - Remove Element
- LeetCode | Remove Element
- leetcode之Remove Element
- LeetCode - Remove Element
- LeetCode: Remove Element
- hdu 6198 number number number
- [LeetCode] 080: Remove Duplicates from Sorted Array
- [LeetCode] 081: Remove Duplicates from Sorted Array II
- [LeetCode] 082: Remove Duplicates from Sorted List
- [LeetCode] 083: Remove Duplicates from Sorted List II
- [LeetCode] 084: Remove Element
- [LeetCode] 085: Remove Nth Node From End of List
- 幂指函数求导公式——备忘
- [LeetCode] 086: Restore IP Addresses
- Oracle 11g Data Guard搭建物理Standby数据库(一)
- [LeetCode] 087: Reverse Integer
- [LeetCode] 088: Reverse Linked List II
- 排序算法学习笔记
- [LeetCode] 089: Reverse Noes in k-Group