标签：style blog http color io for
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.
算法思路：
没啥难度
1 public class Solution { 2 public int removeElement(int[] A, int elem) { 3 if(A == null || A.length == 0) return 0; 4 int index = 0; 5 for(int i = 0; i < A.length; i++){ 6 if(A[i] != elem){ 7 A[index++] = A[i]; 8 } 9 } 10 return index; 11 } 12 }
[leetcode]Remove Element,布布扣,bubuko.com
标签：style blog http color io for
原文地址：http://www.cnblogs.com/huntfor/p/3859431.html
