白玉神驹

摘要： 方式一： - 或者在项目根目录下创建.gitignore文件，并添加 /*.iml/.idea//.gitignore.svn/target/.idea/*.iml*.gitignore //.gitignore只能忽略那些原来没有被track（之前没有add过）的文件，如果某些文件已经被纳入了版本 阅读全文

摘要： With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing ba 阅读全文

摘要： Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a 阅读全文

摘要： 二分查找：在一组数中找到指定的数 //1. 存储在数组中（如果是链表则无法使用二分查找） //2. 有序的排列 （递增或递减，或重复数都无影响） 递归法： //param:有序数组，检索开始为止，结束为止，要查找的数字 //return:返回目标数字所在为止，没有找到返回-1 int binSear 阅读全文

摘要： This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occu 阅读全文

摘要： The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elev 阅读全文

摘要： Given a sequence of K integers { N1​, N2​, ..., NK​ }. A continuous subsequence is defined to be { Ni​, Ni+1​, ..., Nj​ } where 1≤i≤j≤K. The Maximum S 阅读全文

摘要： 动态规划算法的核心 //动态规划算法的核心就是记住已经解决过的子问题的解 通过动态规划解决斐波那契数列 //斐波那契数列(Fibonacci) //递归法 int fib(int n) { if (n == 0) return 0; if (n == 1) return 1; return fib( 阅读全文

摘要： At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door 阅读全文

摘要： Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Specificat 阅读全文