Java uses Hashtable to filter duplicate values in an array _java

The example in this article describes how Java uses Hashtable to filter duplicate values in an array. Share to everyone for your reference, specific as follows:

Package org.eline.core.web.support;
Import java.util.Hashtable; /***************************** * * * @author ZDW * */public class Objectfilter {public static void main (string[) args
  {//String test string arr[] = {"13111", "13112", "13111"};
  Objectfilter SF = new Objectfilter ();
  Object results[] = Sf.filter (arr);
  System.out.println (results.length);
  for (int i = 0; i < results.length ++i) {System.out.println (results[i]);
  //plastic test integer arr2[] = {1, 3, 5, 7, 1, 2, 4, 5};
  Object results2[] = Sf.filter (ARR2);
  for (int i = 0; i < results2.length ++i) {System.out.println (results2[i]);  /************************* * Filtering Method * * @param arr * to filter array * @return/public object[] Filter (Object
  Arr[]) {hashtable<object, object> Hashtable = new Hashtable<object, object> ();
  for (int i = 0; i < arr.length ++i) {hashtable.put (Arr[i], arr[i]);
  Object results[] = null; Results = HASHTABLE.VAlues (). ToArray ();
 return results;

 }
}

More about Java-related content readers can view the site topics: "Java Data structure and algorithm 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.