【LeetCode】27.Remove Element(Easy)解题报告

【LeetCode】27.Remove Element(Easy)解题报告

题目地址：https://leetcode.com/problems/remove-element/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 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.
  Example:
  Given nums = [3,2,2,3], val = 3,
  Your function should return length = 2, with the first two elements of nums being 2.

Solution:

//time:O(n)
//space:O(1)
//list中相等，array中不等.和26，80题非常像,是他们的基础。
class Solution {
    public int removeElement(int[] nums, int val) {
        if(nums == null || nums.length == 0) return 0;
        int res = 0;
        for(int i=0 ; i< nums.length ;i++){
            if(nums[i]!=val){
                nums[res] = nums[i];
                res++;
            }
        }
        return res;
    }
}

Date：2018年1月30日