![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Search
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Search in Rotated Sorted Array II
class Solution { public: bool search(int A[], int n, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function for (int i = 0; i < n; i++)原创 2013-01-25 02:48:00 · 449 阅读 · 0 评论 -
[LeetCode] Subsets II
class Solution { public: vector > ret; vector sln; void DFS(vector &S, int n) { if (S.size() == n) { ret.push_back(sln); return; }原创 2013-01-24 19:44:30 · 513 阅读 · 0 评论 -
[LeetCode] Search a 2D Matrix
class Solution { public: bool searchMatrix(vector > &matrix, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = matrix.size原创 2013-01-26 15:37:23 · 512 阅读 · 0 评论 -
[LeetCode] Subsets
class Solution { public: vector > ret; vector sln; void DFS(vector &S, int n) { if (n == S.size()) { ret.push_back(sln); return; }原创 2013-01-26 14:50:59 · 1141 阅读 · 0 评论 -
[LeetCode] Combinations
class Solution { public: vector > ret; vector sln; void DFS(int n, int k, int m) { if (k == 0) { ret.push_back(sln); return; }原创 2013-01-26 15:00:25 · 530 阅读 · 0 评论