递归
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Letter Combinations of a Phone Number
class Solution { public: vector map; vector ret; vector sln; Solution() { map.push_back(""); map.push_back(""); map.push_back("abc"); map.push_back原创 2013-01-28 18:36:29 · 380 阅读 · 0 评论 -
[LeetCode] Restore IP Addresses
class Solution { public: vector ret; vector sln; int stoi(string s) { int n = s.size(); if (n >= 2 && s[0] == '0') return 256; int ret = 0;原创 2013-01-29 00:28:52 · 364 阅读 · 0 评论 -
[LeetCode] Unique Binary Search Trees II
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti原创 2013-01-29 00:29:02 · 432 阅读 · 0 评论