Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commite834c3b

Browse files
committed
UpdatedREADME.md.
1 parent66eb807 commite834c3b

File tree

2 files changed

+55
-1
lines changed

2 files changed

+55
-1
lines changed

‎README.md

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
#Best practices for LeetCode solutions
1+
#Fuck LeetCode: Best practices for LeetCode solutions
2+
23
Hi there! I'm Lane.
34
Do you feel that there are too many problems (over 3,300) on the LeetCode and you can't finish them all?
45
Or do you forget how to solve the problems you did last time?
@@ -9,6 +10,7 @@ Here, I will provide you with **common problem-solving patterns** so that you do
910
Solutions for languages such as**Python, C++, Java, JavaScript, C#, Go, Ruby**, etc. will also be provided. If you have better solutions, welcome to create an issue or PR!
1011

1112
##How to use this repo?
13+
1214
I have planned a learning route for you. You just need to do the problems in the order they are listed.
1315
You can skip the more difficult problems and do them later.
1416

‎en/3001-4000/unorganized.md

Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -201,13 +201,65 @@ Add a table to show the differences between A-Start and breadth-first search
201201
- 1334https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
202202
- 752 a star
203203
- 3464https://leetcode.cn/problems/maximize-the-distance-between-points-on-a-square
204+
-https://leetcode.cn/problems/closest-equal-element-queries/
205+
-https://leetcode.cn/problems/rotate-array
204206

205207
##other finished problems
206208
-https://leetcode.com/problems/k-closest-points-to-origin/
207209
-https://leetcode.com/problems/find-special-substring-of-length-k/
208210
-https://leetcode.cn/problems/eat-pizzas/
209211
-https://leetcode.cn/problems/merge-intervals/
212+
-https://leetcode.cn/problems/longest-consecutive-sequence
213+
-https://leetcode.cn/problems/container-with-most-water
214+
-https://leetcode.cn/problems/longest-substring-without-repeating-characters
215+
-https://leetcode.cn/problems/product-of-array-except-self/
216+
-https://leetcode.cn/problems/set-matrix-zeroes/
217+
-https://leetcode.cn/problems/copy-list-with-random-pointer/
218+
-https://leetcode.cn/problems/sort-list/
219+
-https://leetcode.cn/problems/maximum-depth-of-binary-tree/
220+
-https://leetcode.cn/problems/invert-binary-tree/
221+
-https://leetcode.cn/problems/symmetric-tree/
222+
-https://leetcode.cn/problems/binary-tree-level-order-traversal
223+
-https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree
224+
-https://leetcode.cn/problems/validate-binary-search-tree
225+
-https://leetcode.cn/problems/kth-smallest-element-in-a-bst
226+
-https://leetcode.cn/problems/binary-tree-right-side-view/
227+
-https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/
228+
-https://leetcode.cn/problems/positions-of-large-groups/
229+
-https://leetcode.cn/problems/masking-personal-information
230+
-https://leetcode.cn/problems/flipping-an-image/
231+
-
210232

211233
##Other algorithm
212234
* 线段树https://leetcode.cn/problems/fruits-into-baskets-iii
213235
*
236+
237+
238+
https://leetcode.cn/problems/closest-equal-element-queries
239+
#Timeout1
240+
#class Solution:
241+
#def solveQueries(self, nums: List[int], queries: List[int]) -> List[int]:
242+
#n = len(nums)
243+
#answer =[]
244+
#
245+
#for i in range(len(queries)):
246+
#index = queries[i]
247+
#num = nums[index]
248+
#
249+
#k = 1
250+
#
251+
#while k < n:
252+
#if num == nums[(index + k) % n]:
253+
#answer.append(k)
254+
#break
255+
#
256+
#if num == nums[index - k]:
257+
#answer.append(k)
258+
#break
259+
#
260+
#k += 1
261+
#
262+
#if k == n:
263+
#answer.append(-1)
264+
#
265+
#return answer

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp