![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
编程基础
hanjibingyan
这个作者很懒,什么都没留下…
展开
-
每日一题--LeetCode.15
题目见链接:力扣https://leetcode-cn.com/problems/3sum/提交代码class Solution {public: vector<vector<int>> threeSum(vector<int>& nums) { int n = nums.size(); if(n<3){ return {}; } set&原创 2021-12-30 17:04:01 · 441 阅读 · 0 评论 -
每日一题--LeetCode203
题目见链接:力扣https://leetcode-cn.com/problems/remove-linked-list-elements/提交代码:/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val原创 2021-12-29 11:52:43 · 230 阅读 · 0 评论 -
C++ 优先队列(priority_queue)用法
A priority queue is a container adaptor that provides constant time lookup of the largest (by default) element, at the expense of logarithmic insertion and extraction.优先队列作为一种常用的容器,可以提供极值的快速查找功能。插入和抽取操作的消耗都是对数级别的。优先队列也可以看作是最大堆或者最小堆的具体实现,所以该数据结构自带的to..翻译 2021-12-24 20:00:00 · 962 阅读 · 0 评论