- 博客(3)
- 收藏
- 关注
RSS订阅原创 LeetCode 220 Contains Duplicate III
题目 Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k. Example1: Input: nums
2020-05-18 13:59:19
133
原创 LeetCode 41 First Missing Positive
题目 Given an unsorted integer array, find the smallest missing positive integer. Example1: Input: [1,2,0] Output: 3 Example2: Input: [3,4,-1,1] Output: 2 Example3: Input: [7,8,9,11,12] Output: 1 Note: Your algorithm should run in O(n) time and uses co
2020-05-18 11:45:02
95
原创 LeetCode189 Rotate Array
LeetCode189 Rotate Array 最近重新开始刷题了！ 因为之前写过的错题总是一错再错，想找个地方总结一下错题，方便之后回忆思路！ 题目 Link: https://leetcode.com/problems/rotate-array/ Given an array, rotate the array to the right by k steps, where k is non-negative. Example1: Input: nums = [1,2,3,4,5,6,7], k =
2020-05-18 01:27:09
97
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人