玩命加载中 . . .

学习之旅
链表总结 链表总结
基础操作用数组获得链表,用尾插法,迭代正向输出,递归反向输出 struct ListNode { int val; ListNode *next; ListNode() : val(0), next(nul
2021-09-23
数组总结 数组总结
统计基础的,统计连续出现的1 485-最大连续1的个数int findMaxConsecutiveOnes(vector<int>& nums) { int cnt = 0, res = 0; for
2021-09-23
347-前k个高频元素 347-前k个高频元素
LeetCode 347. Top K Frequent ElementsLeetCode-347 Given an integer array nums and an integer k, return the k most freque
2021-09-22
25-k个为一组反转链表 25-k个为一组反转链表
LeetCode 25. Reverse Nodes in k-GroupLeetCode-25 Given a linked list, reverse the nodes of a linked list k at a time and
2021-09-22
56-区间合并 56-区间合并
LeetCode 56. Merge IntervalsLeetCode-56 Given an array of intervals where intervals[i] = [starti, endi], merge all overl
2021-09-21
21-合并两个排序的链表 21-合并两个排序的链表
LeetCode 21. Merge Two Sorted ListsLeetCode-21 Merge two sorted linked lists and return it as a sorted list. The list sh
2021-09-18
8-字符串转换整数 8-字符串转换整数
LeetCode 8. String to Integer (atoi)LeetCode-8 Implement the myAtoi(string s) function, which converts a string to a 32-
2021-09-18
66-加一 66-加一
LeetCode 66. Plus OneLeetCode-66 You are given a large integer represented as an integer array digits, where each digits
2021-09-17
4-两个正序数组的中位数 4-两个正序数组的中位数
LeetCode 4. Median of Two Sorted ArraysLeetCode-4 Given two sorted arrays nums1 and nums2 of size m and n respectively,
2021-09-16
239-滑动窗口的最大值 239-滑动窗口的最大值
LeetCode 239. Sliding Window MaximumLeetCode-239 You are given an array of integers nums, there is a sliding window of s
2021-09-16
36/37-数独 36/37-数独
LeetCode 36. Valid SudokuLeetCode-36 Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be valida
2021-09-15
206/92-反转链表 206/92-反转链表
LeetCode 206. Reverse Linked ListLeetCode-206 Given the head of a singly linked list, reverse the list, and return the r
2021-09-15
16 / 24