LeetCode & Q27-Remove Element-Easy

Array Two Pointers

Description:

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 in place with constant memory.

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

Example:

Given input array nums = [3,2,2,3], val = 3

Your function should return length = 2, with the first two elements of nums being 2.

my Solution:

<code class="sourceCode java"><span class="kw">public</span> <span class="kw">class</span> Solution {
    <span class="kw">public</span> <span class="dt">int</span> <span class="fu">removeElement</span>(<span class="dt">int</span>[] nums, <span class="dt">int</span> val) {
        <span class="dt">int</span> j = <span class="dv">0</span>;
        <span class="kw">for</span>(<span class="dt">int</span> i = <span class="dv">0</span>; i < nums.<span class="fu">length</span>; i++) {
            <span class="kw">if</span>(nums[i] != val) {
                nums[j++] = nums[i];
            }
        }
        <span class="kw">return</span> j++;
    }
}</code>

以上是LeetCode & Q27-Remove Element-Easy的详细内容。更多信息请关注PHP中文网其他相关文章！