//使用java 1.8新特性<dependency><groupId>org.apache.commons</groupId><artifactId>commons-lang3</artifactId><version>${commons-lang3.version}</version></dependency>int[] arr ={5,6,6,6,8,8,7,4};
List list = Arrays.asList(ArrayUtils.toObject(arr)).stream().distinct().collect(Collectors.toList());
//常规手段// 方案一:(将数据放入到新的List里面)
List<String> list = Lists.newArrayList();for(int i =0; i < arr.length; i++){if(!list.contains(arr[i])){
list.add(arr[i]);}}// 方案二:(利用Set集合或是TreeSet集合)
Set<String> set = Sets.newHashSet(Arrays.asList(arr));
Iterator<String> it = set.iterator();while(it.hasNext()){
System.out.println(it.next());}// 方案三:(利用Map集合中的keySet、entrySet方法)
Map<String, Object> map = Maps.newHashMap();for(String s : arr){
map.put(s, s);}// for (String key : map.keySet()) {// System.out.println(key);// }for(Map.Entry<String, Object> m : map.entrySet()){
System.out.println(m.getKey());}//方案四:(利用两次for循环,一个正循环,一个倒循环)
List<String> listStr = Lists.newArrayList(arr);for(int i =0; i <= listStr.size()-1; i++){for(int j = listStr.size()-1; j > i; j--){if(listStr.get(i).equals(listStr.get(j))){
listStr.remove(j);}}}