[LeetCode] NO. 27 Remove Element

[题目] 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.

[题目解析] 直接看代码吧。

    public int removeElement(int[] nums, int val) {
         int i = 0;
         for(int num : nums){
        	 if(val != num){
        		 nums[i++] = num;
        	 }
         }
         return i;
    }

[LeetCode] NO. 27 Remove Element

原文：http://www.cnblogs.com/zzchit/p/5817319.html