- 博客(3)
- 收藏
- 关注
RSS订阅原创 LeetCode: Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4
2012-10-01 12:32:01
588
原创 Chapter 9 : Miscellany
1. class B { public: virtual void f() const; }; class D: public B { public: virtual void f(); }; The idea is for D::f to redefine the virtual functionB::f, but there's a mistake: in
2012-10-01 09:57:24
431
原创 LeetCode: Combination Sum II
#include #include #include #include using namespace::std; #include class Solution { public: void getsum(vector & cands, int target, int start, vector > &results, vector path){ if(targ
2012-10-01 07:54:42
610
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人