LeetCode 27 Remove Element, leetcodeelement

Source: Internet
Author: User

LeetCode 27 Remove Element, leetcodeelement

Question:

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.


Translation:

For an array and a val, remove all values identical to the val and return a new length. Element order can be changed,

Ideas:

Similar to the previous question. Define a count to indicate the new length. Find the same element as val and skip it directly. If they are not the same, nums [count ++] = nums [I]; the last count is the number of val values.


Code:

Public int removeElement (int [] nums, int val) {if (nums = null | nums. length = 0) return 0; int count = 0; for (int I = 0; I <nums. length; I ++) {if (nums [I]! = Val) nums [count ++] = nums [I];} return count ;}


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.