- 博客(3)
- 收藏
- 关注
原创 【朱哥yyds】考研转工21天刷题计划-Day3
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> ans; vector<int> temp; temp = nums; int n = temp.size(); sort(temp.begin(), temp.end()); .
2022-03-16 22:08:38
90
原创 【朱哥yyds】考研转工21天刷题计划-Day2
class Solution { public: // 翻转一个子链表,并且返回新的头与尾 pair<ListNode*, ListNode*> myReverse(ListNode* head, ListNode* tail) { ListNode* prev = tail->next; ListNode* p = head; while (prev != tail) { ListNode* nex.
2022-03-15 23:41:12
311
原创 【朱哥yyds】考研转工21天刷题计划-Day1
53 最大子数组和 https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/ dp滚动数组: class Solution { public: int maxSubArray(vector<int>& nums) { int pre = .
2022-03-13 23:42:32
657
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人