[leetcode] Remove Element

Remove Element

  Total Accepted: 40769  Total Submissions: 125507 My Submissions

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.

Show Tags
Have you met this question in a real interview
package com.wyt.leetcodeOJ;

import java.util.Arrays;

/**
 * @author wangyitao
 * @Date 2014-01-20
 * @version 1.0
 * @Description
 * 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 RemoveElement {

	public static void main(String[] args) {
		int[] A = {4,5};
		System.out.println(removeElement(A, 5));
		System.out.println(Arrays.toString(A));;
	}
	
	public static int removeElement(int[] A, int elem) {
		int end = A.length;
        for (int i = 0; i < end; i++) {
			if(A[i] == elem) {
				while (A[end - 1] == elem) {//从后面数,第一个不是elem的
					end--;//end递减
					if(end == 0 || i==end) {//前后两个指针相遇,结束,或者直接从尾指向头
						return end;
					}
				}
				int tmp = A[end-1];
				A[i] = tmp;
				A[end-1] = elem;
				end--;//交换后,向前移动
			}
		}
        return end;
    }

}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值