Leetcode: Remove Element

称号：
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.

这道题比較简单直接看代码，这里多写几个版本号的作參考！

C++版本号

class Solution { public:int removeElement(int A[], int n, int elem){int pt = 0;for (int i = 0; i < n; i++){if (A[i] != elem) A[pt++] = A[i];}return pt;} };

C#版本号：

public class Solution {public int RemoveElement(int[] A, int elem){int pt = 0;for (int i = 0; i < A.Length; i++){if (A[i] != elem) A[pt++] = A[i];}return pt;} }

Python版本号：

class Solution:# @param A a list of integers# @param elem an integer, value need to be removed# @return an integerdef removeElement(self, A, elem):pt = 0for i in range(len(A)):if A[i] != elem:A[pt] = A[i]pt += 1return pt

Java版本号：

public class Solution {public int removeElement(int[] A, int elem) {int pt = 0;for (int i = 0; i < A.length; i++){if (A[i] != elem) A[pt++] = A[i];}return pt;} }

版权声明：本文博主原创文章，博客，未经同意不得转载。

转载于:https://www.cnblogs.com/gcczhongduan/p/4805679.html

总结

以上是生活随笔为你收集整理的Leetcode: Remove Element的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。