FriskyPuppy

摘要： 链接：https://leetcode-cn.com/problems/reverse-linked-list/ 代码： /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/search-a-2d-matrix-ii/ 代码： class Solution(object): def searchMatrix(self, matrix, target): if len(matrix) == 0 or 阅读全文

摘要： 链接：https://leetcode-cn.com/submissions/detail/72680216/ 代码： /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/trapping-rain-water/ 代码： class Solution { public: int trap(vector<int>& height) { int n = height.size(); if(n == 0 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/merge-intervals/ 代码： class Solution { public: // [[2,3],[4,5],[6,7],[8,9],[1,10]] static bool myfunc(vector<int> i 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/friend-circles/ 代码： class Solution { public: void solve(vector<vector<int>>& M, int * vis, int start) { if(vis[sta 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/permutation-sequence/ 代码： class Solution { public: string getPermutation(int n, int k) { int table[11] = {0,1,2,6, 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/longest-consecutive-sequence/ 代码： class Solution { public: int longestConsecutive(vector<int>& nums) { int n = num 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/ 代码： class Solution { public: int findLengthOfLCIS(vector<int>& nums) { 阅读全文

摘要： 链接：https://leetcode-cn.com/problems/search-in-rotated-sorted-array/ 代码： #include <algorithm> class Solution { public: int search(vector<int>& nums, in 阅读全文