Leet常用数据结构【LeetCode】

</pre><pre name="code" class="java">str.toCharArray(); str.getBytes(); String.valueOf(char c);
str.charAt(index);
str.startsWith(str1,k);
str.replaceAll(" ","");str.substring(0,3);
String[] strs = str.split(" ");
Arrays.sort(chars); 
Arrays.copyOfRange(chars,0,3);

integer.intValue();
integer.toString();
Integer.parseInt("12");
Long.parserLong("12");

map.put(key,value);
map.get(key);
map.containsKey();
for(String s:map.keySet())
Irerator it= map.entrySet().iterator();
while(iterator.hasNext()){
	it.next().getKey(); it.next().getValue();
}

list.add/get("aa"); 
Collections.sort(list);
list.toArray(new Object[list.size()]);
String[] str = list.toArray(new String[list.size()]);

Queue queue = new LinkedList();
queue.offer/add("Hello"); queue.poll();
stack.push("aa"); stack.pop(); stack.peek();
set.contains/remove/add("no repeat");