xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-28 04:06:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions
1622 commits 5 branches 9 tags 383 MiB
Commit graph

1622 commits

This branch
This branch
All branches
Author SHA1 Message Date
Yudong Jin
11c2bc1a9d
Merge pull request #193 from Wonderdch/patch-2 
添加 deque.cs
 2022-12-30 16:11:02 +08:00
Yudong Jin
c67363a78e
Update deque.cs 2022-12-30 16:10:22 +08:00
Yudong Jin
2465db1eff
Update space_complexity.md 
Fix the Go code.
 2022-12-30 15:57:15 +08:00
moonache
0cf37e3f8e
添加 deque.cs 
以 C# 内置的双向队列 LinkedList 为基础，编写了 C# 版本的 deque
 2022-12-30 14:35:54 +08:00
moonache
d8bf0b02d1
添加 C# 内置的双向队列示例 
RT
 2022-12-30 14:28:39 +08:00
L-Super
23bbaf12b9
Merge branch 'krahets:master' into patch-1 2022-12-30 09:30:51 +08:00
Listening
0dda12e0ab add insertion sort content 2022-12-30 09:26:26 +08:00
GN-Yu
4ca09c1015
Update merge_sort.md 
修改了代码注释使其表述更严谨，如C++中：

for (int k = left; k <= right; k++) {
            // 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++
            if (i > leftEnd)
                nums[k] = tmp[j++];
            // 否则，若“右子数组已全部合并完”或“左子数组元素 <ins> <= </ins> 右子数组元素”，则选取左子数组元素，并且 i++
            else if (j > rightEnd || tmp[i] <= tmp[j])
                nums[k] = tmp[i++];
            // 否则，若<ins>“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”</ins>，则选取右子数组元素，并且 j++
            else
                nums[k] = tmp[j++];
        }
 2022-12-29 17:50:02 -05:00
陈国太
cd9f4fc35d fix(array and linkedlist): fix that the printing in the test function is the same as that in other languages 2022-12-29 21:49:46 +08:00
Cathay
1faad9e187 Merge branch 'master' of github.com:Cathay-Chen/hello-algo 2022-12-29 17:43:34 +08:00
Cathay
1062fe64a3 feat(linked_list): add the Go code to linked_list docs (Chapter of Array and LinkedList) 2022-12-29 17:43:16 +08:00
龚国玮
a5e923a387 test(binary_search_tree): update test param 
use param value 7, not 5, function test param value with param value in example picture as same.
 2022-12-29 14:44:15 +08:00
Cathay
b3e3aa1e72
Merge branch 'krahets:master' into master 2022-12-29 13:27:03 +08:00
Cathay
c0e8b75bfd feat(array): add the Go code to array docs (Chapter of Array and LinkedList) 2022-12-29 13:26:09 +08:00
龚国玮
4fb267918b docs(array): add file author, created time 2022-12-29 10:06:11 +08:00
steak-zhuo
01b95bc0f9 补充js和ts对应的哈希查找 2022-12-29 03:20:37 +08:00
Yudong Jin
047e15e8d5
Merge pull request #183 from guowei-gong/binary_tree 
docs(binary_tree): fix comment style and punctuation
 2022-12-29 00:50:53 +08:00
Yudong Jin
78fa5e18c3
Merge pull request #184 from XC-Zero/patch-1 
Update data_and_memory.md
 2022-12-29 00:50:07 +08:00
Yudong Jin
78c2b94422
Update data_and_memory.md 2022-12-29 00:49:50 +08:00
Yudong Jin
b58cd21bed
Merge pull request #185 from guowei-gong/binary_search_tree 
docs(binary_search_tree): variable name error
 2022-12-29 00:48:49 +08:00
Yudong Jin
25ad73020a
Merge pull request #177 from danielsss/master 
Add the TypeScript code and docs for Chapter of Binary Search
 2022-12-29 00:48:05 +08:00
sjinzh
678e1a025b add zig language support 2022-12-28 20:04:39 +08:00
Daniel
bb95d47d8e
Merge branch 'krahets:master' into master 2022-12-28 21:56:30 +11:00
龚国玮
debcc984e1 docs(binary_search_tree): variable name error 
Combining Context, Compare 'cur.val' and 'num', not 'cur.val' and 'val`.
 2022-12-28 17:07:59 +08:00
XC-Zero
a4161b5fa2
Update data_and_memory.md 
update tab to space
 2022-12-28 14:27:28 +08:00
XC-Zero
af5497e70b
Update data_and_memory.md 
add code for go
 2022-12-28 14:11:36 +08:00
龚国玮
bd5cfb1117 docs(binary_tree): fix comment style and punctuation 2022-12-28 12:29:29 +08:00
龚国玮
f0c3bf5766 docs(array): reduce understanding cost 
- 去除了并行测试；
- 基于 Java 代码样例，统一了命名风格；
- 基于 Go link 模块代码样例，统一了测试用例风格；
- 我们将 Go 中的 Slice 切片看作 Array 数组。因为这样可以降低理解成本，利于我们将关注点放在数据结构与算法上。
 2022-12-28 10:46:12 +08:00
Yudong Jin
eeb0aec2f1
Merge pull request #166 from L-Super/patch-1 
Update bubble_sort.md
 2022-12-27 20:13:55 +08:00
Yudong Jin
34ad07bfed Fine tune 2022-12-27 20:11:22 +08:00
Yudong Jin
fd6e993f25
Merge pull request #175 from nuomi1/feature/time_complexity-Swift 
feat: add Swift codes for time complexity article
 2022-12-27 20:00:17 +08:00
Yudong Jin
466fdd494b Update the chapter tree. 2022-12-27 19:42:39 +08:00
Yudong Jin
d03980e185 Merge branch 'master' of github.com:krahets/hello-algo 2022-12-27 19:39:37 +08:00
Yudong Jin
e854bbb38d
Merge pull request #138 from a16su/master 
add binary_tree and avl_tree python code
 2022-12-27 19:39:06 +08:00
Yudong Jin
f9cc3a50cf Fine tune 2022-12-27 19:38:14 +08:00
Yudong Jin
449258f0b0 Add the code to the docs. 2022-12-27 19:33:58 +08:00
Yudong Jin
dbb25003ec Fine tune 2022-12-27 19:24:43 +08:00
Yudong Jin
c4d32621c3
Merge branch 'master' into master 2022-12-27 19:16:39 +08:00
a16su
8b401c2acb
fix format error 2022-12-27 18:34:12 +08:00
Yudong Jin
8e9bfabae2 Fix binary search tree. 2022-12-27 17:10:23 +08:00
danielsss
f79089d729
Fixed inconsistent brackets 2022-12-27 17:06:39 +11:00
danielsss
27bad89eeb
Update binary search docs 2022-12-27 16:59:25 +11:00
danielsss
eaa48b6b9f
Fixed wrong parameter of Hash Map Set 2022-12-27 16:52:19 +11:00
Daniel
4e95997386
Merge branch 'krahets:master' into master 2022-12-27 16:50:54 +11:00
Yudong Jin
36507b84a0 Merge branch 'master' of github.com:krahets/hello-algo 2022-12-27 12:15:10 +08:00
Yudong Jin
f1911015f3
Merge pull request #180 from DullSword/patch-2 
docs(chapter_tree/binary_tree/二叉树表示方式 *): TS code
 2022-12-27 12:14:51 +08:00
Yudong Jin
af86129dc9
Merge pull request #179 from DullSword/patch-1 
docs(chapter_tree/binary_tree/二叉树表示方式 *): JS code
 2022-12-27 12:14:06 +08:00
DullSword
142913bc9d
docs(chapter_tree/binary_tree/二叉树表示方式 *): TS code 
与下图及其他编程语言示例代码不一致
 2022-12-27 11:51:04 +08:00
DullSword
9a46bf1d80
docs(chapter_tree/binary_tree/二叉树表示方式 *): JS code 
与下图及其他编程语言示例代码不一致
 2022-12-27 11:34:41 +08:00
龚国玮
b1be0aab15 docs(array): sample code for golang 
本次提交包含如下示例代码。
- 遍历数组；
- 初始化数组；
- 扩展数组长度；
- 在数组中查找指定元素；
- 随机返回一个数组元素；
- 删除索引 index 处元素；
- 在数组的索引 index 处插入元素 num。

所有数组约定长度为 5。原因如下：
在 goalng 中，必须声明数组的长度，例如：nums := [5]int{1,2,3,4,5}。如果不声明长度，则被称为切片。

使用的注释没有按照 golang 的编程惯例，而是倾向于使用文档上下文的注释约定。
所以所有函数注释均使用了 `/* ... */`，而不是双斜杠 `//`。
 2022-12-27 11:25:30 +08:00