摘要:
1 //用到了贪心思想 2 class Solution 3 { 4 public: 5 string small[20] = {"Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten", 6 "Eleve 阅读全文
posted @ 2020-03-24 20:59
Jinxiaobo0509
阅读(220)
评论(0)
推荐(0)
摘要:
1 //所有实现最好写在一个类中 2 class Trie 3 { 4 public: 5 bool is_end; //是否以该单词结尾 6 Trie* son[26]; //该节点儿子的个数 7 Trie() 8 { 9 is_end = false; 10 for(int i = 0;i < 阅读全文
posted @ 2020-03-24 19:07
Jinxiaobo0509
阅读(141)
评论(0)
推荐(0)
摘要:
1 //1、除了小写字母,这些电子邮件还可能包含 '.' 或 '+' 2 //2、每封 emails[i] 都包含有且仅有一个 '@' 字符 3 //3、只考虑本地名称,即'@'字符以前的 4 class Solution 5 { 6 public: 7 int numUniqueEmails(ve 阅读全文
posted @ 2020-03-24 18:36
Jinxiaobo0509
阅读(156)
评论(0)
推荐(0)
摘要:
1 class Solution 2 { 3 vector<int> res; 4 void spilt(string s,char c,vector<int> &res) 5 { 6 istringstream iss(s); 7 string temp; 8 while(getline(iss, 阅读全文
posted @ 2020-03-24 18:31
Jinxiaobo0509
阅读(155)
评论(0)
推荐(0)
摘要:
1 class Solution 2 { 3 //spilt函数的实现 4 //假设以空格切分:char c = ' '; 5 vector<string> res; 6 void spilt(string s,char c,vector<string> &res) 7 { 8 istringstr 阅读全文
posted @ 2020-03-24 18:30
Jinxiaobo0509
阅读(141)
评论(0)
推荐(0)
摘要:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-03-24 12:55
Jinxiaobo0509
阅读(164)
评论(0)
推荐(0)
摘要:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-03-24 12:53
Jinxiaobo0509
阅读(191)
评论(0)
推荐(0)
摘要:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-03-24 12:50
Jinxiaobo0509
阅读(269)
评论(0)
推荐(0)
摘要:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-03-24 12:14
Jinxiaobo0509
阅读(137)
评论(0)
推荐(0)
摘要:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-03-24 12:04
Jinxiaobo0509
阅读(145)
评论(0)
推荐(0)
摘要:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-03-24 11:24
Jinxiaobo0509
阅读(154)
评论(0)
推荐(0)

浙公网安备 33010602011771号