剑指offer刷题API总结

剑指offer刷题API总结

0.Integer

Integer.MAX_VALUE;

Integer.MIN_VALUE;

Integer.max(int n1,int n2);

Integer.min(int n1,int n2):

char和int的相互转换：

5 --> '5' 与 ‘5’转化为5

00000101 表示int时是5，表示char是啥不太清楚；

00011000 表示int是48，表示char是‘0’；

00011101 表示int是53，表示char是‘5’;

综上5 --> ‘5’需要加48再强转，‘5’-->5 只需要-‘0’就可以了

int num = 5;
char c = '5';
System.out.println(c-'0' == num);
System.out.println((char)(num+48) == c);

1.数组

int[] arr =new int[length];

arr.length;

str.trim().equals(String str);

String[] strArr = str.split(" ");

str.toCharArray()

2.字符串

1)String

String str = "";

str.length;

String s = String.valueOf(char[] arr);

String s = String.valueOf(int i);

2)StringBuilder

 StringBuilder sb = new StringBuilder(str);

sb.sunstring(0,n);//包括0不包括n

sb.append(char c);

3)StringBuffer

StringBuffer sb = new StringBuffer();

sb.length;

sb.charAt(int index);

sb.deleteCharAt(int index);

sb.insert(int index,String str);

sb.toString();

3.集合

1） ArrayList

import java.util.ArrayList;

import java.util.List;

import java.util.Collections;

List<T> arrayList = new ArrayList<>();

arrayList.add(T  t);

Collections.reverse(arrayList);

Collections.sort(arrayList);

arrayList.contains(T t);

arrayList.size()

arrayList.remove(arrayList.size()-1);

4.HashMap

import java.util.Map;
import java.util.HashMap;

Map<T1,T2> hashMap = new HashMap<>();

hashMap.get(T1 t1);

hashMap.put(T1,t1,T2 t2);

 

5.Queue

Queue<TreeNode> queue = new LinkedList<>();

queue.offer(root);

TreeNode node = queue.peek();

queue.poll();

 

6.Comparator

import java.util.Collections;
import java.util.Comparator;

 Collections.sort(list, new Comparator<ArrayList<Integer>>() {
            @Override
            public int compare(ArrayList<Integer> o1, ArrayList<Integer> o2) {
                if (o1.size()<o2.size()){
                    return 1;
                }else return -1;
            }
        });