java删除有序数组中的重复元素_算法练习(7): 删除有序数组中的重复元素(1.1.28)...

知识点

遍历数组

打印数组中的每个元素

1.1.28 删除重复元素。修改BinarySearch类中的测试用例来删去排序之后白名单中的所有重复元素。

1.1.28 Remove duplicates. Modify the test client in BinarySearch to remove any duplicate keys in the whitelist after the sort.

分析

这是一道Leecode题目，原题描述如下：

Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,

Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

书中的BinarySearch类如下：

```

import edu.princeton.cs.algs4.In;

import edu.princeton.cs.algs4.StdIn;

import edu.princeton.cs.algs4.StdOut;

import java.util.Arrays;

public class BinarySearch {

public static int rank(int key, int[] a) { // Array must be sorted.

int lo = 0;

int hi = a.length - 1;

while (lo <= hi) { // Key is in a[lo..hi] or not present.

int mid = lo + (hi - lo) / 2;

if (key < a[mid]) hi = mid - 1;

else if (key > a[mid]) lo = mid + 1;

else return mid;

}

return -1;

}

public static void main(String[] args) {

int[] whitelist = In.readInts(args[0]);

Arrays.sort(whitelist);

while (!StdIn.isEmpty()) { // Read key, print if not in whitelist.

int key = StdIn.readInt();

if (rank(key, whitelist) < 0)

StdOut.println(key);

}