public static void main(String[] args) {
HashMap<Integer,Integer> map = new HashMap<>();
map.put(1,3);
map.get(1);
map.getOrDefault(1,0);
map.remove(2);
map.replace(1,1);
map.values();
map.keySet();
map.entrySet();
map.containsKey(1);
map.containsValue(1);
ArrayList<Integer> list = new ArrayList<>();
ArrayList<Integer> list2 = new ArrayList<>(list);
Integer[] a = {1,2};
ArrayList<Integer> list1 = new ArrayList<>(Arrays.asList(a));
Integer[] integers = list.toArray(new Integer[list.size()]);
ArrayList<int[]> list3 = new ArrayList<>();
int[] b = {1,1};
list3.add(b);
int[][] ints = list3.toArray(new int[list3.size()][]);
List<int[]> ints1 = Arrays.asList(ints);
ArrayList<int[]> ints2 = new ArrayList<>(ints1);
Arrays.sort(ints, ((o1, o2) -> o1[0] - o2[0]));
list.add(1);
list.get(0);
list.set(0,1);
list.add(0,1);
list.remove(0);
list.addAll(list);
list.toArray();
list.isEmpty();
list.sort((o1,o2)->o1 - o2);
LinkedList<Integer> linkedList = new LinkedList<>();
linkedList.add(1);//1
linkedList.add(2);//1,2
linkedList.add(3);//1,2,3
linkedList.add(4);//1,2,3,4
linkedList.remove(0);//2,3,4
linkedList.push(1);//1,2,3,4
linkedList.peek();//linkedList.peekFirst();//1,2,3,4
linkedList.poll();//linkedList.pollFirst();//2,3,4
linkedList.pop();//linkedList.pollFirst();//3,4
linkedList.addFirst(1);//1,3,4
linkedList.addLast(5);//1,3,4,5
Stack<Integer> stack = new Stack<>();
stack.push(1);
stack.peek();
stack.isEmpty();
stack.pop();
PriorityQueue<Integer> queue = new PriorityQueue<>(((o1, o2) -> {return o1 - o2;}));
queue.add(1);
queue.contains(1);
queue.peek();
queue.poll();
String s = "12345";
s.toCharArray();//char[]
s.charAt(1);//char
s.compareTo("1");
s.split("3");//"12","45"
s.replace('1','2');//"22345"
System.out.println(s.substring(2));//"345"
System.out.println(s.substring(1,2));//2
System.out.println(s.indexOf("2",1));//"1"
}
java算法常用api
最新推荐文章于 2023-01-30 10:56:17 发布