Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit e59fbbf

Browse files
MangoDownerMangoDowner
committed
Merge remote-tracking branch 'origin/master'
2 parents 29292d4 + a9f6303 commit e59fbbf

File tree

73 files changed

+35
-3851
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

73 files changed

+35
-3851
lines changed

‎.github/FUNDING.yml

Lines changed: 0 additions & 12 deletions
This file was deleted.

‎.gitignore

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
.git/*
2+
.idea/*
3+
.github

‎TEST.md

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
https://leetcode-cn.com/problems/fixed-point/
2+
1064. 不动点
3+
给定已经按 升序 排列、由不同整数组成的数组 arr，返回满足 arr[i] == i 的最小索引 i。如果不存在这样的 i，返回 -1。
4+
5+
6+
7+
示例 1：
8+
9+
输入：arr = [-10,-5,0,3,7]
10+
输出：3
11+
解释：对于给定的数组，arr[0] = -10，arr[1] = -5，arr[2] = 0，arr[3] = 3，因此输出为 3 。
12+
示例 2：
13+
14+
输入：arr = [0,2,5,8,17]
15+
输出：0
16+
解释：arr[0] = 0，因此输出为 0 。
17+
示例 3：
18+
19+
输入：arr = [-10,-5,3,4,7,9]
20+
输出：-1
21+
解释：不存在这样的 i 满足 arr[i] = i，因此输出为 -1 。
22+
23+
24+
提示：
25+
26+
1 <= arr.length < 104
27+
-109 <= arr[i] <= 109
28+
29+
30+
进阶：时间复杂度为 O(n) 的解决方案很直观也很简单。你可以设计更优的解决方案吗？
31+

‎indexes/力扣千题.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -287,6 +287,7 @@
287287
* [594. 最长和谐子序列](../problems/594.最长和谐子序列.md)
288288
* [598. 范围求和 II](../problems/598.范围求和II.md)
289289
* [599. 两个列表的最小索引总和](../problems/599.两个列表的最小索引总和.md)
290+
290291
## 🐯 601-700题
291292
* [605. 种花问题](../problems/605.种花问题.md)
292293
* [606. 根据二叉树创建字符串](../problems/606.根据二叉树创建字符串.md)

‎problems/1065.字符串的索引对.md

100644100755
File mode changed.

‎problems/1199.建造街区的最短时间.md

Lines changed: 0 additions & 1 deletion
This file was deleted.

‎problems/1231.分享巧克力.md

Lines changed: 0 additions & 89 deletions
This file was deleted.

‎problems/1290.二进制链表转整数.md

100644100755
File mode changed.

‎problems/133.克隆图.md

100644100755
File mode changed.

‎problems/1403.非递增顺序的最小子序列.md

Lines changed: 0 additions & 62 deletions
This file was deleted.

‎problems/1414.和为K的最少斐波那契数字数目.md

Lines changed: 0 additions & 71 deletions
This file was deleted.

‎problems/1464.数组中两元素的最大乘积.md

Lines changed: 0 additions & 48 deletions
This file was deleted.

‎problems/1498.满足条件的子序列数目.md

Lines changed: 0 additions & 44 deletions
This file was deleted.

0 commit comments

Comments
 (0)