remove-element

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code> and an integer <code>val</code>, remove all occurrences of <code>val</code> in <code>nums</code> <a href="https://en.wikipedia.org/wiki/In-place_algorithm" target="_blank">in-place</a>. The order of the elements may be changed. Then return the number of elements in <code>nums</code> which are not equal to <code>val</code>.

Consider the number of elements in <code>nums</code> which are not equal to <code>val</code> be <code>k</code>, to get accepted, you need to do the following things:

<ul>
	<li>Change the array <code>nums</code> such that the first <code>k</code> elements of <code>nums</code> contain the elements which are not equal to <code>val</code>. The remaining elements of <code>nums</code> are not important as well as the size of <code>nums</code>.</li>
	<li>Return <code>k</code>.</li>
</ul>

Custom Judge:

The judge will test your solution with the following code:

<pre>
int[] nums = [...]; // Input array
int val = ...; // Value to remove
int[] expectedNums = [...]; // The expected answer with correct length.
 // It is sorted with no values equaling val.

int k = removeElement(nums, val); // Calls your implementation

assert k == expectedNums.length;
sort(nums, 0, k); // Sort the first k elements of nums
for (int i = 0; i &lt; actualLength; i++) {
 assert nums[i] == expectedNums[i];
}
</pre>

If all assertions pass, then your solution will be accepted.

&nbsp;
Example 1:

<pre>
Input: nums = [3,2,2,3], val = 3
Output: 2, nums = [2,2,_,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 2.
It does not matter what you leave beyond the returned k (hence they are underscores).
</pre>

Example 2:

<pre>
Input: nums = [0,1,2,2,3,0,4,2], val = 2
Output: 5, nums = [0,1,4,0,3,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.
Note that the five elements can be returned in any order.
It does not matter what you leave beyond the returned k (hence they are underscores).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 50</code></li>
	<li><code>0 &lt;= val &lt;= 100</code></li>
</ul>

removeElement

Remove Element

Remove Duplicates from Sorted Array

remove-duplicates-from-sorted-array

删除有序数组中的重复项

Remove Linked List Elements

remove-linked-list-elements

移除链表元素

Move Zeroes

move-zeroes

移动零

Array

Two Pointers

&#32473;&#20320;&#19968;&#20010;&#25968;&#32452; <code>nums</code>&nbsp;&#21644;&#19968;&#20010;&#20540; <code>val</code>&#65292;&#20320;&#38656;&#35201; <a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">&#21407;&#22320;</a> &#31227;&#38500;&#25152;&#26377;&#25968;&#20540;&#31561;&#20110;&nbsp;<code>val</code>&nbsp;&#30340;&#20803;&#32032;&#12290;&#20803;&#32032;&#30340;&#39034;&#24207;&#21487;&#33021;&#21457;&#29983;&#25913;&#21464;&#12290;&#28982;&#21518;&#36820;&#22238;&nbsp;<code>nums</code>&nbsp;&#20013;&#19982;&nbsp;<code>val</code>&nbsp;&#19981;&#21516;&#30340;&#20803;&#32032;&#30340;&#25968;&#37327;&#12290;

&#20551;&#35774; <code>nums</code> &#20013;&#19981;&#31561;&#20110; <code>val</code> &#30340;&#20803;&#32032;&#25968;&#37327;&#20026; <code>k</code>&#65292;&#35201;&#36890;&#36807;&#27492;&#39064;&#65292;&#24744;&#38656;&#35201;&#25191;&#34892;&#20197;&#19979;&#25805;&#20316;&#65306;

<ul>
	<li>&#26356;&#25913; <code>nums</code> &#25968;&#32452;&#65292;&#20351; <code>nums</code> &#30340;&#21069; <code>k</code> &#20010;&#20803;&#32032;&#21253;&#21547;&#19981;&#31561;&#20110; <code>val</code> &#30340;&#20803;&#32032;&#12290;<code>nums</code> &#30340;&#20854;&#20313;&#20803;&#32032;&#21644; <code>nums</code> &#30340;&#22823;&#23567;&#24182;&#19981;&#37325;&#35201;&#12290;</li>
	<li>&#36820;&#22238; <code>k</code>&#12290;</li>
</ul>

&#29992;&#25143;&#35780;&#27979;&#65306;

&#35780;&#27979;&#26426;&#23558;&#20351;&#29992;&#20197;&#19979;&#20195;&#30721;&#27979;&#35797;&#24744;&#30340;&#35299;&#20915;&#26041;&#26696;&#65306;

<pre>
int[] nums = [...]; // &#36755;&#20837;&#25968;&#32452;
int val = ...; // &#35201;&#31227;&#38500;&#30340;&#20540;
int[] expectedNums = [...]; // &#38271;&#24230;&#27491;&#30830;&#30340;&#39044;&#26399;&#31572;&#26696;&#12290;
 // &#23427;&#20197;&#19981;&#31561;&#20110; val &#30340;&#20540;&#25490;&#24207;&#12290;

int k = removeElement(nums, val); // &#35843;&#29992;&#20320;&#30340;&#23454;&#29616;

assert k == expectedNums.length;
sort(nums, 0, k); // &#25490;&#24207; nums &#30340;&#21069; k &#20010;&#20803;&#32032;
for (int i = 0; i &lt; k; i++) {
 assert nums[i] == expectedNums[i];
}</pre>

&#22914;&#26524;&#25152;&#26377;&#30340;&#26029;&#35328;&#37117;&#36890;&#36807;&#65292;&#20320;&#30340;&#35299;&#20915;&#26041;&#26696;&#23558;&#20250; &#36890;&#36807;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [3,2,2,3], val = 3
&#36755;&#20986;&#65306;2, nums = [2,2,_,_]
&#35299;&#37322;&#65306;&#20320;&#30340;&#20989;&#25968;&#24212;&#35813;&#36820;&#22238; k = 2, &#24182;&#19988; nums &#20013;&#30340;&#21069;&#20004;&#20010;&#20803;&#32032;&#22343;&#20026; 2&#12290;
&#20320;&#22312;&#36820;&#22238;&#30340; k &#20010;&#20803;&#32032;&#20043;&#22806;&#30041;&#19979;&#20102;&#20160;&#20040;&#24182;&#19981;&#37325;&#35201;&#65288;&#22240;&#27492;&#23427;&#20204;&#24182;&#19981;&#35745;&#20837;&#35780;&#27979;&#65289;&#12290;</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [0,1,2,2,3,0,4,2], val = 2
&#36755;&#20986;&#65306;5, nums = [0,1,4,0,3,_,_,_]
&#35299;&#37322;&#65306;&#20320;&#30340;&#20989;&#25968;&#24212;&#35813;&#36820;&#22238; k = 5&#65292;&#24182;&#19988; nums &#20013;&#30340;&#21069;&#20116;&#20010;&#20803;&#32032;&#20026; 0,0,1,3,4&#12290;
&#27880;&#24847;&#36825;&#20116;&#20010;&#20803;&#32032;&#21487;&#20197;&#20219;&#24847;&#39034;&#24207;&#36820;&#22238;&#12290;
&#20320;&#22312;&#36820;&#22238;&#30340; k &#20010;&#20803;&#32032;&#20043;&#22806;&#30041;&#19979;&#20102;&#20160;&#20040;&#24182;&#19981;&#37325;&#35201;&#65288;&#22240;&#27492;&#23427;&#20204;&#24182;&#19981;&#35745;&#20837;&#35780;&#27979;&#65289;&#12290;
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>0 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 50</code></li>
	<li><code>0 &lt;= val &lt;= 100</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support