Java data structure and algorithm nodups removal of duplicates algorithm example _java

The example of this paper describes the Java data structure and algorithm of the nodups removal of duplicate algorithm. Share to everyone for your reference, specific as follows:

public static void Nodupa (int[] a) {
  int count = 0;//in
  int sub = 0;//counter for
  (int i=0; i<a.length-1; i++) {// Outer Loop
    if (A[i]!= a[i+1]) {
      A[count] = a[i];
      count++
    }}
  }

PS: Feel this algorithm rough to see what, in fact, quite exquisite!! Prerequisites---Arrays are in order, thin and tasteful.

More about Java algorithms Interested readers can view the site topics: "Java data structure and algorithms tutorial", "Java Operation DOM node skills summary", "Java file and directory operation tips Summary" and "Java Cache operation Tips"

I hope this article will help you with Java programming.