Leetcode: Remove Element
来源:互联网 发布:搜狗输入法mac版 编辑:程序博客网 时间:2024/05/16 06:14
http://oj.leetcode.com/problems/remove-element/
class Solution {public: int removeElement(int A[], int n, int elem) { if(n==0) return 0; int start=0, end=n-1; while(start<end){ while(start<end&&A[start]!=elem) start++; while(start<end&&A[end]==elem) end--; swap(A[start],A[end]); } if(A[start]==elem) return start; else return start+1; }};
- 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
- 【LeetCode】Remove Element
- Leetcode: Search Insert Position
- Leetcode: Remove Duplicates from Sorted Array
- JS限制textbox或textarea输入字符长度
- Leetcode: Convert Sorted Array to Binary Search Tree
- Leetcode: Unique Binary Search Trees
- Leetcode: Remove Element
- Leetcode: Populating Next Right Pointers in Each Node
- Leetcode: Maximum Subarray
- Leetcode: Merge Two Sorted Lists
- Leetcode: Binary Tree Inorder Traversal
- Leetcode: Roman to Integer
- Leetcode: Single Number
- Leetcode: Swap Nodes in Pairs
- Leetcode: Integer to Roman