- 博客(14)
- 收藏
- 关注
RSS订阅原创 Leetcode刷题-692前k个高频词
//知识点：哈希/堆/STL/queue/priority_queue/unordered_map#include<iostream>using namespace std;#include<vector>#include<unordered_map>#include<queue>#include<string>class Solution {public: using PIS = pair<string, int>.
2022-04-21 14:57:32
186
原创 Leetcode刷题-215数组中的第k个最大元素
//知识点：堆/STL/queue/priority_queue#include<iostream>using namespace std;#include<vector>#include<queue>class Solution {public: int findKthLargest(vector<int>& nums, int k) { priority_queue<int, vector<int>, les.
2022-04-21 10:01:02
70
原创 Leetcode刷题-705设计哈希集合
//知识点：哈希/vector#include<iostream>using namespace std;#include<vector>class MyHashSet {public: MyHashSet() { hashset.resize(1000001, 0); } void add(int key) { hashset[key] = true; } void remove(int key) { hashset[key] = false.
2022-04-21 08:56:47
184
原创 Leetcode刷题-389找不同
//知识点：哈希-STL-unordered_map#include<iostream>using namespace std;#include<string>#include<unordered_map>class Solution {public: char findTheDifference(string s, string t) { unordered_map<int, int> hashmap; for (char c : .
2022-04-20 10:16:14
65
原创 Leetcode刷题-217存在重复元素
//知识点：哈希-STL-unordered_map#include<iostream>using namespace std;#include<vector>#include<unordered_map>class Solution {public: bool containsDuplicate(vector<int>& nums) { unordered_map<int, int> hashmap; if (n.
2022-04-20 09:50:18
53
原创 Leetcode刷题-496下一个更大元素
//知识点：栈 stack//特点：先进后出#include<iostream>using namespace std;#include<stack>#include<vector>class Solution {public: vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) { stack<in.
2022-04-19 15:04:15
158
原创 Leetcode刷题-020有效的括号
//知识点：栈 stack//特点：先进后出#include<iostream>using namespace std;#include<stack>#include<string>class Solution {public: bool isValid(string s) { for (char a : s) { if (a == '(' || a == '[' || a == '{') { st.push(a); .
2022-04-19 10:46:52
149
原创 Leetcode刷题-206反转链表
#include<iostream>using namespace std;//Definition for singly-linked list.struct ListNode { int val; ListNode *next; ListNode() : val(0), next(nullptr) {} ListNode(int x) : val(x), next(nullptr) {} ListNode(int x, ListNode *n.
2022-04-18 11:10:16
57
原创 Leetcode刷题-203移除链表元素
#include<iostream>using namespace std;//Definition for singly-linked list.struct ListNode { int val; ListNode *next; ListNode() : val(0), next(nullptr) {} ListNode(int x) : val(x), next(nullptr) {} ListNode(int x, ListNode *n.
2022-04-18 11:09:09
1057
原创 Leetcode刷题-485最大连续1的个数
#include<iostream>#include<algorithm>using namespace std;#include<vector>class Solution {public: int findMaxConsecutiveOnes(vector<int>& nums) { int count = 0, maxcount = 0; for (int i = 0; i < nums.size(); i++) .
2022-04-17 19:54:48
124
原创 Leetcode刷题-283移动零
#include<iostream>#include<algorithm>using namespace std;#include<vector>class Solution {public: void moveZeroes(vector<int>& nums) { int j = 0; for (int i = 0; i < nums.size(); i++) { if (nums[i] != 0) {.
2022-04-17 19:54:01
223
原创 Leetcode刷题-027移除元素
#include<iostream>#include<algorithm>using namespace std;#include<vector>class Solution {public: int removeElement(vector<int>& nums, int val) { int j = 0; for (int i = 0; i < nums.size(); i++) { if (nums[i] .
2022-04-17 19:53:18
157
原创 Leetcode刷题-002两数相加
#include<iostream>using namespace std;#include<list> //Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) { val = x; } /* ListNode(int x) : val(0), next(nullptr) {} ListNode(.
2022-04-17 19:51:24
270
原创 Leetcode刷题-001两数之和
#include<iostream>#include<algorithm>using namespace std;#include<string>#include<vector>class Solution {public: vector<int> twoSum(vector<int>&nums, int target) { int n = nums.size(); for (int i = 0; i .
2022-04-17 14:11:18
48
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人