1、Stack
Stack<Integer> stack = new Stack<>();
stack.push(); stack.pop() stack.peak();
stack.size();
stack.isEmpty()
2、Queue
Queue<Interge> queue = new LinkedList<>(); queue.offer(); queue.poll(); queue.peek();
queue.size();
queue.isEmpty();
3、String/Array/List
//长度 String: length() Array: length List: size() // 增 List: list.add() // 删除 List:list.remove(list.size()-1) //删除最后一个元素 //索引 String: s.charAt(i) // 变成char类型 Array: a[i] List: list.get(i)
// 互转
String-> Array: s.toCharArray()
Array->String: Arrays.toString(array)
String-> List: for 循环遍历
List-> String:StringUtils.join("",list)
Array->List: Arrays.asList(a); Arrays.asList()方法返回的对象是Arrays的内部类,对list的操作仍然反映在原数组上,因此这个list是定长的,不支持add、remove操作
Array->List: for循环
List->Array: list.toArray()