leetcode
文章平均质量分 68
AKUNNN
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
# 495. Teemo Attacking
495. Teemo Attacking In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo’s attacking ascending time series towards Ashe ...原创 2018-10-28 17:05:18 · 196 阅读 · 0 评论 -
#Leetcode:665,605
665:Non-decreasing Array Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element. We define an array is non-decreasing if array[i] <= ...原创 2018-10-23 10:57:00 · 182 阅读 · 0 评论 -
# 189. Rotate Array # 581. Shortest Unsorted Continuous Subarray
189. Rotate Array Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: [1,2,3,4,5,6,7] and k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 steps to ...原创 2018-10-27 16:50:26 · 136 阅读 · 0 评论 -
# 581. Shortest Unsorted Continuous Subarray # 769. Max Chunks To Make Sorted
581. Shortest Unsorted Continuous Subarray Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted ...原创 2018-11-01 15:32:09 · 167 阅读 · 0 评论 -
# 75. Sort Colors
75. Sort Colors Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we ...原创 2018-11-15 16:39:22 · 123 阅读 · 0 评论 -
# 795. Number of Subarrays with Bounded Maximum
795. Number of Subarrays with Bounded Maximum We are given an array A of positive integers, and two positive integers L and R (L <= R). Return the number of (contiguous, non-empty) subarrays such t...原创 2018-11-15 17:06:08 · 138 阅读 · 0 评论 -
# 873. Length of Longest Fibonacci Subsequence
873. Length of Longest Fibonacci Subsequence A sequence X_1, X_2, ..., X_nis fibonacci-like if: n >= 3 X_i + X_{i+1} = X_{i+2} for all i + 2 <= n Given a strictly inc...原创 2018-11-15 17:19:26 · 123 阅读 · 0 评论 -
# 11. Container With Most Water
11. Container With Most Water Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at ...原创 2018-11-17 21:54:09 · 126 阅读 · 0 评论
分享