摘要：
Problem description:http://oj.leetcode.com/problems/combination-sum-ii/Basic idea: use recursive approach, remember to avoid duplicate item. 1 class Solution { 2 public: 3 bool isExist(vector > &combinations, vector &item) { 4 for(auto com: combinations){ 5 if(com.size() == i... 阅读全文
