java写题常用方法和类

排序

Arrays.sort(int[])


list=new ArrayList<>();
        list.add(7);
        list.add(3);
        list.add(5);
        list.sort(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o1-o2;
            }
        });
        System.out.println(list);

String.valueOf(123);
Integer.valueOf("123");

        String string="3445";
        StringBuilder stringBuilder=new StringBuilder(string);
        stringBuilder.append('3');
        stringBuilder.append("345");
        String s1=stringBuilder.substring(3);
        String s2=stringBuilder.substring(3,5);
        System.out.printf("%s %s\n",s1,s2);
        stringBuilder.deleteCharAt(2);
        System.out.println(stringBuilder.toString());

Scanner scanner=new Scanner(System.in);
scanner.next();//读取字符串，遇见空格和换行会断掉
scanner.nextInt();
scanner.nextDouble();

scanner.nextLine();//读取整行的字符串

//同时使用next()和nextLine()需要在next()后使用nextLine()将换行符读取掉，再读

//循环读
        while(scanner.hasNextInt())
        {
            System.out.println(scanner.nextInt());
        }

System.out.printf("%d %s %c %.1f",x,y,z,t);

        Queue<Integer> queue=new LinkedList<>();
        System.out.println(queue.isEmpty());
        queue.add(10);
        queue.add(15);
        queue.add(20);
        queue.add(13);
        System.out.println(queue.peek());
        System.out.println(queue.poll());
        System.out.println(queue.size());
        System.out.println(queue.peek());

public void test3()
    {

        Queue<Node> queue=new PriorityQueue<>();
        System.out.println(queue.isEmpty());
        queue.add(new Node(1,3));
        queue.add(new Node(2,3));
        queue.add(new Node(1,2));
        Node node=queue.poll();
        System.out.println(String.format("{x=%d;y=%d}",node.x,node.y));
         node=queue.peek();
        System.out.println(String.format("{x=%d;y=%d}",node.x,node.y));
    }
    class Node implements Comparable<Node>
    {
        int x;
        int y;
        public Node(int x,int y)
        {
            this.x=x;
            this.y=y;
        }
        @Override
        public int compareTo(Node o) {
            if(this.x==o.x)
                return this.y-o.y;
            else
                return this.x-o.x;
        }
    }

Deque<Integer> deque=new LinkedList<>();
        deque.addLast(10);
        deque.addLast(20);
        deque.addLast(30);
        System.out.println(deque.getFirst());
        System.out.println(deque.getLast());
        deque.addFirst(40);
        System.out.println(deque.getFirst());
        System.out.println(deque.removeFirst());
        System.out.println(deque.getFirst());
        deque.removeLast();
        System.out.println(deque.getLast());

Set<Integer> set=new HashSet<>();
set.add(5);
set.contains(5);
set.remove(5);
set.size();
set.isEmpty();

Map<Integer,Integer> map=new HashMap<>();
map.put(2,3);
map.containsKey(2);
map.get(2);
map.getOrDefault(2,0);
map.size();
map.isEmpty();
//遍历
        for(int x:hashMap.keySet()){
            System.out.println(x);
        }
        for(int x: hashMap.values()){
            System.out.println(x);
        }
    
    for (Map.Entry<Integer,Integer> entry:hashMap.entrySet()){
            System.out.println(entry.getKey());
            System.out.println(entry.getValue());
        }