問題描述:

Given an array and a value, remove all instances of that value?in-place?and return the new length.

Do not allocate extra space for another array, you must do this by?modifying the input array?in-place?with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

代碼如下: 3ms

int removeElement(int* nums, int numsSize, int val) {int length = 0;for(int i = 0;i<numsSize;++i){if(nums[i] != val){nums[length] = nums[i];++length;}}return length; }

　　

轉載于:https://www.cnblogs.com/gtxvs/p/7985903.html

總結

以上是生活随笔為你收集整理的leetcode 27. Remove Element的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

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