摘要： http://blog.csdn.net/windows1989/article/details/7237052 阅读全文

摘要： http://blog.csdn.net/liufeng_king/article/details/8497607 阅读全文

摘要： http://blog.csdn.net/cs_guoxiaozhu/article/details/14104789http://oj.leetcode.com/problems/word-break-ii/ 阅读全文

摘要： 1 Iterator> ite=lhmap.entrySet().iterator();2 ite.next();3 ite.remove(); 删除前到后的元素4 ite.next();5 ite.remove();6 lhmap.put(key, value); LinkedHashMap lhmap=new LinkedHashMap(capacity,0.75f,true);L... 阅读全文

摘要： http://blog.csdn.net/xymyeah/article/details/1629480 阅读全文

摘要： 1 import java.awt.Point; 2 import java.io.BufferedInputStream; 3 import java.util.ArrayList; 4 import java.util.List; 5 import java.util.Map; 6 import java.util.Scanner; 7 8 public class Main { 9 10 static int T=0,n=0,knum=0,sum=0,count=0; 11 // public static void dfs(List list,i... 阅读全文

摘要： 1 public static void main(String[] args) { 2 // Exams 1: 3 { 4 System.out.println("examples "+count++ +": "); 5 x--; 6 System.out.println(x); 7 myMethod(); 8 System.out.println(x+y+++x); 9 } 10 //Exams 2: 11... 阅读全文

摘要： 1 ArrayList list=new ArrayList(); 2 for(int i=1;i<8;i++) 3 list.add(i); 4 final int which=8; 5 int countNum=0; 6 int index=0; 7 8 while(list.isEmpty()==false) 9 {10 countNum=countNum+1; //计数用的11 ... 阅读全文

摘要： 1 private static void qsort_asc(int source[],int low,int high) 2 { 3 if(lowsource[i])17 i++;18 if(isource[low])15 low++;16 if(low<high)17 source[high]=source[low];18 }19 ... 阅读全文

摘要： 1 Scanner cin = new Scanner(new BufferedInputStream(System.in));2 int a;3 while (cin.hasNextInt())4 {5 a = cin.nextInt();6 System.out.print(a+" ");7 } 阅读全文