摘要：
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeat 阅读全文
摘要：
首先说下标准库的swap算法:1 namespace std{2 template3 void swap(T & a, T & b)4 {5 T tmp = a;6 a = b;7 b = tmp;8 }9 }显然的，标... 阅读全文
摘要：
首先还是下面这个class;class Rational{public: Rational(int numirator = 0, int denominator = 1); int numurator() const; int denominator() ... 阅读全文