List 去重排序，Map 遍历

import com.alibaba.fastjson.JSONObject;

import java.util.*;

public class GSTest {


    //list 去重复
    public static void main1(String[] args) {
        List<String> users=new ArrayList<>();
        users.add("2");
        users.add("1");
        users.add("3");
        users.add("4");
        users.add("2");
        users.add("2");
        users.parallelStream().distinct().forEach(System.out::println);
        System.out.print(JSONObject.toJSONString(users));
    }


    //list排序
    public static void main(String[] args) {
        List<Integer> list=new ArrayList<>();
        list.add(1);
        list.add(12);
        list.add(13);
        list.add(14);
        list.add(15);
        list.add(16);
        Collections.sort(list, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                //o1-o2  从小到大
                //o2-o1 从大到小
                return o1-o2;
            }
        });
        System.out.print(JSONObject.toJSONString(list));
    }


    //遍历map
    public static void main11(String[] args) {
        HashMap<String,Object> map=new HashMap<>();
        map.put("key1","1");
        map.put("key2","2");

        Set<Map.Entry<String,Object>> entry=map.entrySet();
        for(Map.Entry<String,Object> entry_elem:entry){
            System.out.println(entry_elem.getKey()+":"+entry_elem.getValue().toString());
        }
    }

}

 

转载于:https://www.cnblogs.com/g-sheng/p/8807228.html