Method recur

77. Combinations/Solution.cpp:17–28

recur

    }
//recur
    void recur(int n, int k, vector<vector<int>> & v, vector<int> & buf) {
        if ( k == 0 ) {
            v.push_back(buf);
            return;
        } else {
            for (int i=k; i<=n; i++) {
                buf.push_back(i);
                this->recur(i-1, k-1, v, buf);
                buf.pop_back();
            }
        }
    }
};

int main() {