稱號(hào)：
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.

這道題比較簡(jiǎn)單直接看代碼，這里多寫幾個(gè)版本號(hào)的作參考！

C++版本號(hào)

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#版本號(hào)：

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版本號(hào)：

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版本號(hào)：

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;} }

版權(quán)聲明：本文博主原創(chuàng)文章，博客，未經(jīng)同意不得轉(zhuǎn)載。

轉(zhuǎn)載于:https://www.cnblogs.com/gcczhongduan/p/4805679.html

總結(jié)

以上是生活随笔為你收集整理的Leetcode: Remove Element的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。