靠近1

分类

/ 注册

全部文章（共45篇）

题解 | #【模板】拓扑排序#

#include <iostream> #include <vector> #include <queue> using namespace std; int N = 2e5 +10; vector<vector<int>> edges(N...

2024-07-24

0 96

题解 | #打家劫舍(一)#

class Solution { public: int rob(vector<int>& nums) { int n = nums.size(); vector<int> f(n,0); vector<...

2024-07-23

0 118

题解 | #打家劫舍(一)#

class Solution { public: int rob(vector<int>& nums) { int n = nums.size(); vector<int> f(n,0); vector<...

2024-07-23

0 131

题解 | #删除相邻数字的最大分数#

#include <iostream> using namespace std; int main() { int n; cin >> n; int x[10001] = {0},y[10001] = {0}; int arr[10001] ...

2024-07-23

0 140

题解 | #重排字符串#

class Solution { public: string rearrangestring(string str) { string ret; int arr[26] = { 0 };//建立哈希表，统计出现的字符 int n = str...

2024-07-22

1 183

题解 | #重排字符串#

class Solution { public: string rearrangestring(string str) { int arr[26] = {0}; string s; int n = str.size(); in...

2024-07-22

0 142

题解 | #最长无重复子数组#

class Solution { public: int maxLength(vector<int>& arr) { int v[100010] = { 0 }; int n = arr.size(); int start...

2024-07-22

0 122

题解 | #两个链表的第一个公共结点#

class Solution { public: ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) { ListNode* cut1 = pHead1; ListNode* c...

2024-07-20

0 118

题解 | #两个链表的第一个公共结点#

class Solution { public: ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) { ListNode* cut1 = pHead1; ListNode* c...

2024-07-20

0 124

题解 | #删除公共字符#

#include <iostream> using namespace std; int main() { string s1,s2; getline(cin,s1); getline(cin,s2); bool arr[300] = {0}; for(i...

2024-07-20

0 152