![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Array
liuziran09
这个作者很懒,什么都没留下…
展开
-
2020-12-14 11. Container With Most Water
11. Container With Most Water Difficulty: Medium Related Topics: Array, Two Pointers Given 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 Matrix Difficulty: Medium Related Topics: Array Given 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: Medium Related Topics: Array, Hash Table, Design Implement 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-12 56. Merge Intervals
56. Merge Intervals Difficulty: Medium Related Topics: Array, Sort Given 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 Self Difficulty: Medium Related Topics: Array Given 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 评论 -
42\. Trapping Rain Water
42. Trapping Rain Water Difficulty: Hard Related Topics: Array, Two Pointers, Stack Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height =原创 2020-10-21 09:59:21 · 70 阅读 · 0 评论