摘要：
2017-3-7-lint82single-number在河之洲算法小书匠 problem82single-number/ solution int singleNumber(vector &A) { // write your code here if (A.empty()) return 0; int result =... 阅读全文
摘要：
2017-3-7-lint183-wood-cut在河之洲算法lintcode problemlintcode183 wood cut solution注意两点注意边界条件取的是最大值而不是最小值. int woodCut(vector L, int k) { // write your code here //先找到L里面最短的; // write you... 阅读全文