
文章目录
概述
所有LeetCode数组类算法题汇总。
数组篇
# | 题名 | 刷题 |
---|---|---|
1 | 两数之和 | C#LeetCode刷题之#1-两数之和(Two Sum) |
4 | 两个排序数组的中位数 | C#LeetCode刷题之#4-两个排序数组的中位数(Median of Two Sorted Arrays) |
11 | 盛最多水的容器 | C#LeetCode刷题之#11-盛最多水的容器(Container With Most Water) |
15 | 三数之和 | C#LeetCode刷题之#15-三数之和(3Sum) |
16 | 最接近的三数之和 | C#LeetCode刷题之#16-最接近的三数之和(3Sum Closest) |
18 | 四数之和 | |
26 | 删除排序数组中的重复项 | C#LeetCode刷题之#26-删除排序数组中的重复项(Remove Duplicates from Sorted Array) |
27 | 移除元素 | C#LeetCode刷题之#27-移除元素(Remove Element) |
31 | 下一个排列 | C#LeetCode刷题之#31-下一个排列(Next Permutation) |
33 | 搜索旋转排序数组 | C#LeetCode刷题之#33-搜索旋转排序数组(Search in Rotated Sorted Array) |
34 | 在排序数组中查找元素的第一个和最后一个位置 | C#LeetCode刷题之#34-在排序数组中查找元素的第一个和最后一个位置(Find First and Last Position of Element in Sorted Array) |
35 | 搜索插入位置 | C#LeetCode刷题之#35-搜索插入位置(Search Insert Position) |
39 | 组合总和 | C#LeetCode刷题之#39-组合总和(Combination Sum) |
40 | 组合总和 II | C#LeetCode刷题之#40-组合总和 II(Combination Sum II) |
41 | 缺失的第一个正数 | |
42 | 接雨水 | |
45 | 跳跃游戏 II | |
48 | 旋转图像 | C#LeetCode刷题之#48-旋转图像(Rotate Image) |
53 | 最大子序和 | C#LeetCode刷题之#53-最大子序和(Maximum Subarray) |
54 | 螺旋矩阵 | C#LeetCode刷题之#54-螺旋矩阵(Spiral Matrix) |
55 | 跳跃游戏 | C#LeetCode刷题之#55-跳跃游戏(Jump Game) |
56 | 合并区间 | C#LeetCode刷题之#56-合并区间(Merge Intervals) |
57 | 插入区间 | |
59 | 螺旋矩阵 II | C#LeetCode刷题之#59-螺旋矩阵 II(Spiral Matrix II) |
62 | 不同路径 | C#LeetCode刷题之#62-不同路径(Unique Paths) |
63 | 不同路径 II | C#LeetCode刷题之#63-不同路径 II(Unique Paths II) |
64 | 最小路径和 | |
66 | 加一 | C#LeetCode刷题之#66-加一(Plus One) |
73 | 矩阵置零 | |
74 | 搜索二维矩阵 | |
75 | 颜色分类 | |
78 | 子集 | |
79 | 单词搜索 | |
80 | 删除排序数组中的重复项 II | |
81 | ||
84 | ||
85 | ||
88 | C#LeetCode刷题之#88-合并两个有序数组(Merge Sorted Array) | |
90 | ||
105 | ||
106 | ||
118 | C#LeetCode刷题之#118-杨辉三角(Pascal\’s Triangle) | |
119 | C#LeetCode刷题之#119-杨辉三角 II(Pascal\’s Triangle II) | |
120 | ||
121 | C#LeetCode刷题之#121-买卖股票的最佳时机(Best Time to Buy and Sell Stock) | |
122 | C#LeetCode刷题之#122-买卖股票的最佳时机 II(Best Time to Buy and Sell Stock II) | |
123 | ||
126 | ||
128 | ||
152 | ||
153 | ||
154 | ||
162 | ||
167 | C#LeetCode刷题之#167-两数之和 II – 输入有序数组(Two Sum II – Input array is sorted) | |
169 | C#LeetCode刷题之#169-求众数(Majority Element) | |
189 | C#LeetCode刷题之#189-旋转数组(Rotate Array) | |
209 | ||
216 | ||
217 | C#LeetCode刷题之#217-存在重复元素(Contains Duplicate) | |
219 | C#LeetCode刷题之#219-存在重复元素 II(Contains Duplicate II) | |
228 | ||
229 | ||
238 | ||
268 | C#LeetCode刷题之#268-缺失数字(Missing Number) | |
283 | C#LeetCode刷题之#283-移动零(Move Zeroes) | |
287 | ||
289 | ||
380 | ||
381 | ||
414 | C#LeetCode刷题之#414-第三大的数(Third Maximum Number) | |
442 | ||
448 | C#LeetCode刷题之#448-找到所有数组中消失的数字(Find All Numbers Disappeared in an Array) | |
485 | C#LeetCode刷题之#485-最大连续1的个数(Max Consecutive Ones) | |
495 | ||
532 | C#LeetCode刷题之#532-数组中的K-diff数对(K-diff Pairs in an Array) | |
560 | ||
561 | C#LeetCode刷题之#561-数组拆分 I(Array Partition I) | |
565 | ||
566 | C#LeetCode刷题之#566-重塑矩阵( Reshape the Matrix) | |
581 | C#LeetCode刷题之#581-最短无序连续子数组( Shortest Unsorted Continuous Subarray) | |
605 | C#LeetCode刷题之#605-种花问题( Can Place Flowers) | |
611 | ||
621 | ||
628 | C#LeetCode刷题之#628-三个数的最大乘积( Maximum Product of Three Numbers) | |
643 | C#LeetCode刷题之#643-子数组最大平均数 I( Maximum Average Subarray I) | |
661 | C#LeetCode刷题之#661-图片平滑器( Image Smoother) | |
665 | C#LeetCode刷题之#665-非递减数列( Non-decreasing Array) | |
667 | ||
670 | ||
674 | C#LeetCode刷题之#674-最长连续递增序列( Longest Continuous Increasing Subsequence) | |
689 | ||
695 | C#LeetCode刷题之#695-岛屿的最大面积( Max Area of Island) | |
697 | C#LeetCode刷题之#697-数组的度( Degree of an Array) | |
713 | ||
714 | ||
715 | ||
717 | C#LeetCode刷题之#717-1比特与2比特字符( 1-bit and 2-bit Characters) | |
718 | ||
719 | ||
724 | C#LeetCode刷题之#724-寻找数组的中心索引( Find Pivot Index) | |
729 | ||
731 | ||
746 | C#LeetCode刷题之#746-使用最小花费爬楼梯( Min Cost Climbing Stairs) | |
747 | C#LeetCode刷题之#747-至少是其他数字两倍的最大数( Largest Number At Least Twice of Others) | |
766 | C#LeetCode刷题之#766-托普利茨矩阵(Toeplitz Matrix) | |
768 | ||
769 | ||
775 | ||
782 | ||
792 | ||
795 | ||
825 | ||
830 | C#LeetCode刷题之#830-较大分组的位置(Positions of Large Groups) | |
835 | ||
840 | C#LeetCode刷题之#840-矩阵中的幻方(Magic Squares In Grid) | |
849 | C#LeetCode刷题之#849-到最近的人的最大距离(Maximize Distance to Closest Person) | |
867 | C#LeetCode刷题之#867-转置矩阵(Transpose Matrix) | |
873 | ||
888 | C#LeetCode刷题之#888-公平的糖果交换(Fair Candy Swap) | |
891 | ||
896 | C#LeetCode刷题之#896-单调数列(Monotonic Array) |
本文由 .Net中文网 原创发布,欢迎大家踊跃转载。
转载请注明本文地址:https://www.byteflying.com/archives/1017。