LeetCode刷题 - 随笔分类(第2页) - hjy94wo

LeetCode 1 两数之和

摘要：class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> map; for (int i = 0; i < nums.size(); i ++) { aut 阅读全文

posted @ 2022-09-05 17:36 hjy94wo 阅读(18) 评论(0) 推荐(0)

LeetCode 202 快乐数

摘要：class Solution { public: int getSum(int n) { int sum = 0; while (n) { sum += (n % 10) * (n % 10); n /= 10; } return sum; } bool isHappy(int n) { unord 阅读全文

posted @ 2022-09-05 17:15 hjy94wo 阅读(16) 评论(0) 推荐(0)

LeetCode 349 两个数组的交集

摘要：class Solution { public: bool record[1010]; vector<int> res; vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { unordered_set<int> set 阅读全文

posted @ 2022-09-05 16:13 hjy94wo 阅读(22) 评论(0) 推荐(0)

LeetCode 242 有效的字母异位词

摘要：class Solution { public: bool isAnagram(string s, string t) { if (s.size() != t.size()) return false; sort(s.begin(), s.end()); sort(t.begin(), t.end( 阅读全文

posted @ 2022-09-05 15:47 hjy94wo 阅读(9) 评论(0) 推荐(0)

LeetCode 47 全排列 II

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; int used[10]; void dfs(vector<int>& nums) { if (path.size() == nums.size()) { res. 阅读全文

posted @ 2022-09-05 14:57 hjy94wo 阅读(14) 评论(0) 推荐(0)

LeetCode 46 全排列

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; bool used[10]; void dfs(vector<int>& nums) { if (path.size() == nums.size()) { res 阅读全文

posted @ 2022-09-05 14:44 hjy94wo 阅读(18) 评论(0) 推荐(0)

LeetCode 491 递增子序列

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; int num = -101; void dfs(int start, vector<int>& nums) { if (path.size() > 1) { re 阅读全文

posted @ 2022-09-05 10:51 hjy94wo 阅读(8) 评论(0) 推荐(0)

LeetCode 90 子集 II

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; void dfs(int start, vector<int>& nums) { res.push_back(path); for (int i = start; 阅读全文

posted @ 2022-09-05 10:07 hjy94wo 阅读(14) 评论(0) 推荐(0)

LeetCode 78 子集

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; void dfs(int start, vector<int>& nums) { res.push_back(path); for (int i = start; 阅读全文

posted @ 2022-09-05 08:45 hjy94wo 阅读(19) 评论(0) 推荐(0)

LeetCode 93 复原 IP 地址

摘要：class Solution { public: vector<string> res; int pointNum; bool isValid(string s, int begin, int end) { if (begin > end) return false; //防止在最后末尾插入. if 阅读全文

posted @ 2022-09-04 15:54 hjy94wo 阅读(29) 评论(0) 推荐(0)

LeetCode 131 分割回文串

摘要：class Solution { public: vector<vector<string>> res; vector<string> path; bool is(string s, int start, int end) { for (int i = start, j = end; i < j; 阅读全文

posted @ 2022-09-04 15:00 hjy94wo 阅读(17) 评论(0) 推荐(0)

LeetCode 216 组合总和 III

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; int sum = 0; void dfs(int start, int k, int n) { if (path.size() > k || sum > n) r 阅读全文

posted @ 2022-09-04 14:34 hjy94wo 阅读(16) 评论(0) 推荐(0)

LeetCode 40 组合总和 II

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; int sum; void dfs(int start, vector<int>& candidates, int target) { if (sum > targ 阅读全文

posted @ 2022-09-04 09:18 hjy94wo 阅读(29) 评论(0) 推荐(0)

LeetCode 19 组合总和

摘要：class Solution { public: vector<vector<int>> res; vector<int> path; int sum = 0; void dfs(int start, vector<int>& candidates, int target) { if (sum > 阅读全文

posted @ 2022-09-04 08:51 hjy94wo 阅读(17) 评论(0) 推荐(0)

LeetCode 17 电话号码的字母组合

摘要：dfs 定义string数组初始化后加; char型 - ‘0’转为int型 class Solution { public: vector<string> res; string path; const string map[10] = { "", "", "abc", "def", "ghi", 阅读全文

posted @ 2022-09-02 16:37 hjy94wo 阅读(24) 评论(0) 推荐(0)

LeetCode 77 组合

摘要：dfs class Solution { public: vector<int> path; vector<vector<int>> res; void dfs(int start, int n, int k) { if (path.size() == k) { res.push_back(path 阅读全文

posted @ 2022-09-02 16:11 hjy94wo 阅读(18) 评论(0) 推荐(0)

LeetCode 51 n皇后

摘要：const int N = 20; class Solution { public: vector<vector<string>> res; bool col[N], dg[N], udg[N]; void dfs(int u, int n, vector<string>& path) { if ( 阅读全文

posted @ 2022-09-02 15:29 hjy94wo 阅读(16) 评论(0) 推荐(0)

LeetCode 150. 逆波兰表达式求值

摘要：思路：当字符串为运算符号是弹出栈中两个数字进行运算 stoi("1") 将string转换为int class Solution { public: int evalRPN(vector<string>& tokens) { stack<int> stack; for (int i = 0; i 阅读全文

posted @ 2022-08-27 09:59 hjy94wo 阅读(22) 评论(0) 推荐(0)

LeetCode 1047. 删除字符串中的所有相邻重复项

摘要：class Solution { public: string removeDuplicates(string s) { stack<char> stack; for (int i = 0; i < s.size(); i ++) { if (stack.empty() || s[i] != sta 阅读全文

posted @ 2022-08-27 09:18 hjy94wo 阅读(20) 评论(0) 推荐(0)

LeetCode 20. 有效的括号

摘要：class Solution { public: bool isValid(string s) { stack<char> stack; for (int i = 0; i < s.size(); i ++) { if (s[i] == ')' || s[i] =='}' || s[i] == '] 阅读全文

posted @ 2022-08-27 09:10 hjy94wo 阅读(17) 评论(0) 推荐(0)

hjy94wo

随笔分类 - LeetCode刷题

公告