![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Leetcode
liuziran09
这个作者很懒,什么都没留下…
展开
-
2021-02-08 Verifying an Alien Dictionary
953. Verifying an Alien DictionaryDifficulty: EasyRelated Topics: Hash TableIn an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation原创 2021-02-08 13:45:10 · 74 阅读 · 0 评论 -
1235. Maximum Profit in Job Scheduling
1235. Maximum Profit in Job SchedulingDifficulty: HardRelated Topics: Binary Search, Dynamic Programming, SortWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].You’re given the star原创 2021-02-03 00:28:03 · 100 阅读 · 0 评论 -
2021-01-29 973. K Closest Points to Origin
973. K Closest Points to OriginDifficulty: MediumRelated Topics: Divide and Conquer, Heap, SortWe have a list of points on the plane. Find the K closest points to the origin (0, 0).(Here, the distance between two points on a plane is the Euclidean dis原创 2021-01-29 09:35:32 · 71 阅读 · 0 评论 -
2021-01-28 253. Meeting Rooms II
253. Meeting Rooms IIDifficulty: MediumRelated Topics: Heap, Greedy, SortGiven an array of meeting time intervals intervals where intervals[i] = [start<sub style="display: inline;">i</sub>, end<sub style="display: inline;">i</sub>原创 2021-01-28 09:43:34 · 58 阅读 · 0 评论 -
2021-01-28 1277. Count Square Submatrices with All Ones
1277. Count Square Submatrices with All OnesDifficulty: MediumRelated Topics: Array, Dynamic ProgrammingGiven a m * n matrix of ones and zeros, return how many square submatrices have all ones.Example 1:Input: matrix =[ [0,1,1,1], [1,1,1,1], [0原创 2021-01-28 02:39:17 · 114 阅读 · 0 评论 -
2021-01-25 1314. Matrix Block Sum
1314. Matrix Block SumDifficulty: MediumRelated Topics: Dynamic ProgrammingGiven a m * n matrix mat and an integer K, return a matrix answer where each answer[i][j] is the sum of all elements mat[r][c] for i - K <= r <= i + K, j - K <= c <=原创 2021-01-26 01:00:26 · 70 阅读 · 0 评论 -
2021-01-25 1641. Count Sorted Vowel Strings
1641. Count Sorted Vowel StringsDifficulty: MediumRelated Topics: Math, Dynamic Programming, BacktrackingGiven an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted.A string原创 2021-01-25 10:43:44 · 94 阅读 · 0 评论 -
2020-12-14 11. Container With Most Water
11. Container With Most WaterDifficulty: MediumRelated Topics: Array, Two PointersGiven n non-negative integers a<sub style="display: inline;">1</sub>, a<sub style="display: inline;">2</sub>, ..., a<sub style="display: inline;原创 2020-12-14 17:26:17 · 45 阅读 · 0 评论 -
2020-12-13 54. Spiral Matrix
54. Spiral MatrixDifficulty: MediumRelated Topics: ArrayGiven an m x n matrix, return all elements of the matrix in spiral order.Example 1:[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-SY0KckVf-1607852674083)(https://assets.leetcode.com/uploads/2020/11/13/sp原创 2020-12-13 17:45:22 · 106 阅读 · 0 评论 -
2020-12-13 380. Insert Delete GetRandom O(1)
380. Insert Delete GetRandom O(1)Difficulty: MediumRelated Topics: Array, Hash Table, DesignImplement the RandomizedSet class:bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwi原创 2020-12-13 16:54:58 · 80 阅读 · 0 评论 -
2020-12-13 560. Subarray Sum Equals K
560. Subarray Sum Equals KDifficulty: MediumRelated Topics: Array, Hash TableGiven an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals to k.Example 1:Input: nums = [1,1,1], k = 2Output: 2Exam原创 2020-12-13 16:07:07 · 49 阅读 · 0 评论 -
2020-12-12 56. Merge Intervals
56. Merge IntervalsDifficulty: MediumRelated Topics: Array, SortGiven an array of intervals where intervals[i] = [start<sub style="display: inline;">i</sub>, end<sub style="display: inline;">i</sub>], merge all overlapping interv原创 2020-12-12 13:12:56 · 51 阅读 · 0 评论 -
2020-12-12 238. Product of Array Except Self
238. Product of Array Except SelfDifficulty: MediumRelated Topics: ArrayGiven an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Example:Input原创 2020-12-12 10:50:38 · 58 阅读 · 0 评论