LeetCode 27 Remove Element

Problem:

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.

Analysis:

去掉数组中和val相等的值并返回最终得到的数组长度。

Summary:

 1 class Solution {
 2 public:
 3     int removeElement(vector<int>& nums, int val) {
 4         int len = nums.size();
 5         int j = 0;
 6         for (int i = 0; i < len; i++) {
 7             if (nums[i] != val) {
 8                 nums[j++] = nums[i];
 9             }
10         }
11         
12         return j;
13     }
14 };

LeetCode 27 Remove Element

原文：http://www.cnblogs.com/VickyWang/p/6236238.html