LeetCode_27：移除元素：Java

package LeetCode.contact;

class Solution_27 {
    public int removeElement(int[] nums, int val) {
    	int count = 0; //记录数组中和val值相同的个数
    	for(int i = 0; i <nums.length-count; i++){
    		int temp = 0;
    		//如果检索到相同，把数组最后的数赋值给当前位置
    		if(nums[i] == val){
    			nums[i] = nums[nums.length-1-count];
    			nums[nums.length-1-count] = temp;
    			i--;
    			count++;
    		}
    	}
    	return nums.length - count;

    }
}
public class leetcode_27 {
		public static void main(String[] args){
			int target = 3;
			int[] arr = new int[]{1,3,5,6,3,3};
			Solution_27 so = new Solution_27();
			int count = so.removeElement(arr, target);
			System.out.println(count);
		}
}