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

Commit8a79009

Browse files
committed
update images
1 parent2bb0fdf commit8a79009

File tree

7 files changed

+20
-20
lines changed

7 files changed

+20
-20
lines changed

‎README.md

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
#算法模板
22

3-
![来刷题了](https://raw.githubusercontent.com/greyireland/algorithm-pattern/master/images/title.png)
3+
![来刷题了](https://img.fuiboom.com/img/title.png)
44

55
算法模板，最科学的刷题方式，最快速的刷题路径，一个月从入门到 offer，你值得拥有~
66

@@ -47,9 +47,9 @@
4747

4848
从 4 月份找工作开始，从 0 开始刷 LeetCode，中间大概花了一个半月(6 周)左右时间刷完 240 题。
4949

50-
![一个半月刷完240题](https://raw.githubusercontent.com/greyireland/algorithm-pattern/master/images/leetcode_time.png)
50+
![一个半月刷完240题](https://img.fuiboom.com/img/leetcode_time.png)
5151

52-
![刷题记录](https://raw.githubusercontent.com/greyireland/algorithm-pattern/master/images/leetcode_record.png)
52+
![刷题记录](https://img.fuiboom.com/img/leetcode_record.png)
5353

5454
开始刷题时，确实是无从下手，因为从序号开始刷，刷到几道题就遇到 hard 的题型，会卡住很久，后面去评论区看别人怎么刷题，也去 Google 搜索最好的刷题方式，发现按题型刷题会舒服很多，基本一个类型的题目，一天能做很多，慢慢刷题也不再枯燥，做起来也很有意思，最后也收到不错的 offer（最后去了宇宙系）。
5555

@@ -61,15 +61,15 @@
6161

6262
1、[algorithm-pattern 练习题](https://greyireland.gitbook.io/algorithm-pattern/)
6363

64-
![练习题](https://raw.githubusercontent.com/greyireland/algorithm-pattern/master/images/repo_practice.png)
64+
![练习题](https://img.fuiboom.com/img/repo_practice.png)
6565

6666
2、[LeetCode 卡片](https://leetcode-cn.com/explore/)
6767

68-
![探索卡片](https://raw.githubusercontent.com/greyireland/algorithm-pattern/master/images/leetcode_explore.png)
68+
![探索卡片](https://img.fuiboom.com/img/leetcode_explore.png)
6969

7070
3、[剑指 offer](https://leetcode-cn.com/problemset/lcof/)
7171

72-
![剑指offer](https://raw.githubusercontent.com/greyireland/algorithm-pattern/master/images/leetcode_jzoffer.png)
72+
![剑指offer](https://img.fuiboom.com/img/leetcode_jzoffer.png)
7373

7474
刷题时间可以合理分配，如果打算准备面试了，建议前面两部分 一个半月 （6 周）时间刷完，最后剑指 offer 半个月刷完，边刷可以边投简历进行面试，遇到不会的不用着急，往模板上套就对了~
7575

@@ -85,4 +85,4 @@
8585

8686
持续更新中，觉得还可以的话点个**star** 收藏呀 ⭐️~
8787

88-
【 Github 】[https://github.com/greyireland/algorithm-pattern](https://github.com/greyireland/algorithm-pattern) ⭐️
88+
【 Github 】[https://github.com/greyireland/algorithm-pattern](https://github.com/greyireland/algorithm-pattern) ⭐️

‎advanced_algorithm/backtrack.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ func backtrack(选择列表,路径):
2828
2929
遍历过程
3030

31-
![image.png](../images/backtrack.png)
31+
![image.png](https://img.fuiboom.com/img/backtrack.png)
3232

3333
```go
3434
funcsubsets(nums []int) [][]int {

‎basic_algorithm/binary_search.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515

1616
典型示例
1717

18-
[binary-search](https://leetcode-cn.com/problems/binary-search/) 
18+
[binary-search](https://leetcode-cn.com/problems/binary-search/)
1919

2020
>给定一个  n  个元素有序的（升序）整型数组  nums 和一个目标值  target  ，写一个函数搜索  nums  中的 target，如果目标值存在返回下标，否则返回 -1。
2121
@@ -52,7 +52,7 @@ func search(nums []int, target int) int {
5252

5353
另外二分查找还有一些其他模板如下图，大部分场景模板#3 都能解决问题，而且还能找第一次/最后一次出现的位置，应用更加广泛
5454

55-
![binary_search_template](../images/binary_search_template.png)
55+
![binary_search_template](https://img.fuiboom.com/img/binary_search_template.png)
5656

5757
所以用模板#3 就对了，详细的对比可以这边文章介绍：[二分搜索模板](https://leetcode-cn.com/explore/learn/card/binary-search/212/template-analysis/847/)
5858

‎basic_algorithm/dp.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -25,15 +25,15 @@
2525

2626
遍历
2727

28-
![image.png](../images/dp_triangle.png)
28+
![image.png](https://img.fuiboom.com/img/dp_triangle.png)
2929

3030
分治法
3131

32-
![image.png](../images/dp_dc.png)
32+
![image.png](https://img.fuiboom.com/img/dp_dc.png)
3333

3434
优化 DFS，缓存已经被计算的值（称为：记忆化搜索 本质上：动态规划）
3535

36-
![image.png](../images/dp_memory_search.png)
36+
![image.png](https://img.fuiboom.com/img/dp_memory_search.png)
3737

3838
动态规划就是把大问题变成小问题，并解决了小问题重复计算的方法称为动态规划
3939

‎basic_algorithm/sort.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -90,11 +90,11 @@ func merge(left, right []int) (result []int) {
9090

9191
>完美二叉树 VS 其他二叉树
9292
93-
![image.png](../images/tree_type.png)
93+
![image.png](https://img.fuiboom.com/img/tree_type.png)
9494

9595
[动画展示](https://www.bilibili.com/video/av18980178/)
9696

97-
![image.png](./../images/heap.png)
97+
![image.png](https://img.fuiboom.com/img/heap.png)
9898

9999
核心代码
100100

‎data_structure/linked_list.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -368,7 +368,7 @@ func reverseList(head *ListNode) *ListNode {
368368
>给定一个链表，判断链表中是否有环。
369369
370370
思路：快慢指针，快慢指针相同则有环，证明：如果有环每走一步快慢指针距离会减 1
371-
![fast_slow_linked_list](../images/fast_slow_linked_list.png)
371+
![fast_slow_linked_list](https://img.fuiboom.com/img/fast_slow_linked_list.png)
372372

373373
```go
374374
funchasCycle(head *ListNode)bool {
@@ -394,7 +394,7 @@ func hasCycle(head *ListNode) bool {
394394
>给定一个链表，返回链表开始入环的第一个节点。  如果链表无环，则返回  `null`。
395395
396396
思路：快慢指针，快慢相遇之后，慢指针回到头，快慢指针步调一致一起移动，相遇点即为入环点
397-
![cycled_linked_list](../images/cycled_linked_list.png)
397+
![cycled_linked_list](https://img.fuiboom.com/img/cycled_linked_list.png)
398398

399399
```go
400400
funcdetectCycle(head *ListNode) *ListNode {

‎data_structure/stack_queue.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
栈的特点是后入先出
66

7-
![image.png](../images/stack.png)
7+
![image.png](https://img.fuiboom.com/img/stack.png)
88

99
根据这个特点可以临时保存一些数据，之后用到依次再弹出来，常用于 DFS 深度搜索
1010

@@ -296,11 +296,11 @@ func dfs(grid [][]byte,i,j int)int{
296296
297297
思路：求以当前柱子为高度的面积，即转化为寻找小于当前值的左右两边值
298298

299-
![image.png](../images/stack_rain.png)
299+
![image.png](https://img.fuiboom.com/img/stack_rain.png)
300300

301301
用栈保存小于当前值的左的元素
302302

303-
![image.png](../images/stack_rain2.png)
303+
![image.png](https://img.fuiboom.com/img/stack_rain2.png)
304304

305305
```go
306306
funclargestRectangleArea(heights []int)int {

0 commit comments

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