Leetcode
关注
分享
扫一扫
小堃哥
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
leetcode240+Search a 2D Matrix II+从右上角开始
【代码】leetcode240+Search a 2D Matrix II+从右上角开始。原创 2023-02-19 22:57:40 · 256 阅读 · 0 评论 -
leetcode238+Product of Array Except Self+前缀数组
【代码】leetcode238+Product of Array Except Self+前缀数组。原创 2023-02-19 11:29:03 · 104 阅读 · 0 评论 -
leetcode230+Kth Smallest Element in a BST+dfs
【代码】leetcode230+Kth Smallest Element in a BST+dfs。原创 2023-02-18 22:49:36 · 87 阅读 · 0 评论 -
leetcode226+Invert Binary Tree
【代码】leetcode226+Invert Binary Tree。原创 2023-02-18 19:15:46 · 91 阅读 · 0 评论 -
leetcode+215. Kth Largest Element in an Array+快排思想
【代码】leetcode+215. Kth Largest Element in an Array+快排思想。原创 2023-02-18 15:37:15 · 74 阅读 · 0 评论 -
leetcode141+Linked List Cycle
【代码】leetcode141+Linked List Cycle。原创 2023-02-13 22:26:40 · 83 阅读 · 0 评论 -
leetcode122+Best Time to Buy and Sell Stock II
【代码】leetcode122+Best Time to Buy and Sell Stock II。原创 2023-02-11 21:23:09 · 86 阅读 · 0 评论 -
leetcode121+Best Time to Buy and Sell Stock+dp
【代码】leetcode121+Best Time to Buy and Sell Stock+dp。原创 2023-02-10 23:19:57 · 101 阅读 · 0 评论 -
leetcode118+Pascal‘s Triangle
【代码】leetcode118+Pascal's Triangle。原创 2023-02-10 23:08:13 · 292 阅读 · 0 评论 -
leetcode49+Group Anagrams+排序加用map
【代码】leetcode49+Group Anagrams+排序加用map。原创 2023-02-05 14:39:16 · 77 阅读 · 0 评论 -
leetcode48+Rotate Image+矩阵变化两次就行
【代码】leetcode48+Rotate Image+矩阵变化两次就行。原创 2023-02-05 12:40:25 · 66 阅读 · 0 评论 -
leetcode+11. Container With Most Water+双指针
【代码】leetcode+11. Container With Most Water+双指针。原创 2023-01-15 21:19:12 · 175 阅读 · 0 评论 -
leetcode42+Trapping Rain Water+双指针
【代码】leetcode42+Trapping Rain Water+双指针。原创 2023-01-15 19:29:43 · 95 阅读 · 0 评论 -
leetcode+3. Longest Substring Without Repeating Characters+滑动窗口
【代码】leetcode+3. Longest Substring Without Repeating Characters+滑动窗口。原创 2023-01-15 14:44:31 · 86 阅读 · 0 评论 -
leetcode+2. Add Two Numbers+链表
【代码】leetcode+2. Add Two Numbers+链表。原创 2023-01-15 14:37:54 · 94 阅读 · 0 评论 -
Leetcode1443. Minimum Time to Collect All Apples in a Tree+dfs
【代码】Leetcode1443. Minimum Time to Collect All Apples in a Tree+dfs。原创 2023-01-15 14:36:11 · 83 阅读 · 0 评论 -
leetcode+608. Tree Node+SQL+判断二叉树节点类型
【代码】leetcode+608. Tree Node+SQL+判断二叉树节点类型。原创 2023-01-09 15:56:25 · 118 阅读 · 0 评论 -
leetcode+144. Binary Tree Preorder Traversal+前序遍历+注意vector好存储
【代码】leetcode+144. Binary Tree Preorder Traversal+前序遍历+注意vector好存储。原创 2023-01-09 12:22:14 · 197 阅读 · 1 评论 -
leetcode+2207. Maximize Number of Subsequences in a String+贪心+prefix_sum
【代码】leetcode+2207. Maximize Number of Subsequences in a String+贪心+prefix_sum。原创 2023-01-08 23:13:50 · 83 阅读 · 0 评论 -
Leetcode994. Rotting Oranges+经典BFS题目
【代码】Leetcode994. Rotting Oranges+经典BFS题目。原创 2023-01-08 20:58:54 · 72 阅读 · 0 评论 -
Leetcode+求两个数和等于一个固定值+循环就好
点击打开链接int* twoSum(int* nums, int numsSize, int target) { int *a=(int*)malloc(2*sizeof(int)); for(int i=0;i<numsSize;i++){ for(int j=i+1;(j<numsSize&&j!=i);j++){ if(nums[i]+原创 2017-09-15 09:55:33 · 351 阅读 · 0 评论 -
百练+链表相加+主要就是链表的操作
点击打开链接//Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} //构造函数简写方式 };class Solution {public: ListNode*原创 2017-09-15 09:57:17 · 229 阅读 · 0 评论 -
leetcode+string变成整数+注意各种考虑情况
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-12 13:43:21 · 236 阅读 · 0 评论 -
leetcode+数字转换为罗马数字
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-12 13:54:47 · 380 阅读 · 0 评论 -
leetcode+three sum+双指针
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-12 13:56:29 · 260 阅读 · 0 评论 -
leetcode+three sum closet+标记一下INT_MIN
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-12 13:59:26 · 278 阅读 · 0 评论 -
leetcode+最长回文子串+n^2+循环便利每个元素，然后分奇偶进行探讨，找出最大的
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using namespace std;class Soluti原创 2018-01-05 00:59:26 · 210 阅读 · 0 评论 -
leetcode+求最大无重复字母字串+n^2,循环记得标记，循环有点像最长上升子序列
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using namespace std;class Soluti原创 2018-01-05 00:56:34 · 136 阅读 · 0 评论 -
leetcode+二分，左右两边二分，右半边严格小于左半边
点击打开链接//拆成两半，两半都是有序的，左半边严格大于右半边#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define原创 2018-01-23 00:40:07 · 248 阅读 · 0 评论 -
leetcode+c++STL函数
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using namespace原创 2018-01-23 00:41:19 · 716 阅读 · 0 评论 -
leetcode+平时说的标记数组就是hashtable
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-23 00:42:21 · 181 阅读 · 0 评论 -
leetcode+组合调用STL
点击打开链接class Solution {public: vector> permute(vector& nums) { int n=nums.size(); sort(nums.begin(), nums.end()); vector> res;//这样申请二维数组 do{ res.push_ba原创 2018-01-23 00:43:33 · 943 阅读 · 0 评论 -
leetcode+组合调用STL，先排序
点击打开链接class Solution{public:public: vector> permuteUnique(vector& nums) { int n=nums.size(); sort(nums.begin(),nums.end()); vector> res; do{ res.push_原创 2018-01-23 00:44:23 · 398 阅读 · 0 评论 -
leetcode+相同单词类在一块，使用map好就行
点击打开链接class Solution {public: vector> groupAnagrams(vector& strs) { if(strs.empty()) return vector> (); int len=strs.size(); sort(strs.begin(),strs.end()); vector>原创 2018-01-23 00:45:43 · 249 阅读 · 0 评论 -
leetcode+大数相乘，数组模拟
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-23 11:19:46 · 779 阅读 · 0 评论 -
leetcode+rotate image.找规律
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using原创 2018-01-23 11:52:32 · 156 阅读 · 0 评论 -
leetcode+双指针求最大容积，思维。一左一右指针
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include #include #define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using namespa原创 2018-01-07 23:02:04 · 222 阅读 · 0 评论 -
leetcode+pow函数实现，快速幂。可以重载leetcode函数，trick
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include #include #define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using namespa原创 2018-01-07 23:05:13 · 343 阅读 · 0 评论 -
leetcode+找规律题目，不过string能用push_back
点击打开链接//发现所有行的重复周期都是 2 * nRows - 2//对于首行和末行之间的行，还会额外重复一次，重复的这一次距////离本周期起始字符的距离是 2 * nRows - 2 - 2 * i#include#include#include#include#include#include#include#include#include#include#inclu原创 2018-01-07 23:10:17 · 358 阅读 · 0 评论 -
leetcode+链表翻转，快慢指针，经典套路
点击打开链接///head指示的就是链表的首元素。 快慢指针#include#include#include#include#include#include#include#include#includeusing namespace std;struct ListNode { int val; ListNode *next; ListNode(int原创 2018-01-31 17:15:50 · 280 阅读 · 0 评论