[leetcode]Remove Element

标签：leetcode   算法   

问题描述：

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.

代码：

public class Remove_Element {  //java
	public int removeElement(int[] A, int elem) {
		    int begin=0;
		    for(int i=0;i<A.length;i++) 
		    	if(A[i]!=elem) A[begin++]=A[i];
		    return begin;
    }
}

[leetcode]Remove Element

标签：leetcode   算法   

原文地址：http://blog.csdn.net/chenlei0630/article/details/40625403