摘要: 题目链接:https://www.acwing.com/problem/content/86/ /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(i 阅读全文
posted @ 2022-06-20 09:54 杨振奎 阅读(22) 评论(0) 推荐(0)
摘要: 题目链接:https://www.acwing.com/problem/content/description/90/ class MinStack { public: stack<int> s1, s2; /** initialize your data structure here. */ Mi 阅读全文
posted @ 2022-06-20 09:44 杨振奎 阅读(8) 评论(0) 推荐(0)
摘要: 题目链接:https://www.acwing.com/problem/content/description/1050/ 第一种方式:O(nm) #include <bits/stdc++.h> using namespace std; const int N = 110, M = 15; int 阅读全文
posted @ 2022-06-20 09:36 杨振奎 阅读(78) 评论(0) 推荐(0)
摘要: // Forward declaration of queryAPI. // int query(int x, int y); // return int means matrix[x][y]. class Solution { public: vector<int> getMinimumValue 阅读全文
posted @ 2022-06-13 09:07 杨振奎 阅读(37) 评论(0) 推荐(0)
摘要: 题目地址 阅读全文
posted @ 2022-06-12 23:42 杨振奎 阅读(21) 评论(0) 推荐(0)
摘要: import torch import torch.utils.data.dataset as Dataset import numpy as np import torch.utils.data.dataloader as DataLoader Data = np.asarray([[1, 2], 阅读全文
posted @ 2022-06-12 23:36 杨振奎 阅读(48) 评论(0) 推荐(0)
摘要: AcWing 1451. 单链表快速排序 /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ // 思路: // 阅读全文
posted @ 2022-06-12 23:34 杨振奎 阅读(22) 评论(0) 推荐(0)