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

560 commits

This branch
This branch
All branches
Author SHA1 Message Date
Yudong Jin
f06f80b6ee
Merge pull request #205 from nuomi1/feature/space_time_tradeoff-Swift 
feat: add Swift codes for space time tradeoff article
 2023-01-05 01:13:37 +08:00
Yudong Jin
2c21f54a76
Merge pull request #154 from MolDuM/master 
Add array code in C
 2023-01-05 01:11:44 +08:00
Yudong Jin
2899f453fb
Merge branch 'master' into master 2023-01-05 01:11:34 +08:00
Yudong Jin
89acc732d3
Merge pull request #206 from Wonderdch/patch-3 
错别字：从顶置底 -> 从顶至底
 2023-01-05 01:08:11 +08:00
moonache
5775794351
错别字：从顶置底 -> 从顶至底 2023-01-04 19:27:35 +08:00
MolDuM
e0a3189f91
Update array.c 
3 changes:
1. In the enlarge part, I didn't change because I didn't find a good way to deal with the local variable and the clear definition. malloc is commonly used in LeetCode so I think it is not bad for a beginner.
2. I changed the initialization of the second array to make it in the same style as C++.
3. In the enlarge part in main, I deleted the code of pointer free to match the array operations. I also changed the operate array in the later part because the enlarged array cannot be assigned to the older array name.

BTW, sorry for updating so late. Reading different version documents and book are really tiring and boring.
 2023-01-04 14:56:16 +08:00
nuomi1
2069dddd3b
feat: add Swift codes for space time tradeoff article 2023-01-03 23:28:59 +08:00
Yudong Jin
4ac254d1f7
Merge pull request #197 from nuomi1/feature/space_complexity-Swift 
feat: add Swift codes for space complexity article
 2023-01-03 23:12:43 +08:00
nuomi1
377200a39a
refactor: use Package.swift to define executable task 2023-01-03 22:15:58 +08:00
Yudong Jin
e850152130 Update the rotation cases of the AVL tree. 2023-01-03 03:40:01 +08:00
Yudong Jin
2890771d93 Update stack.md 2023-01-02 21:52:40 +08:00
nuomi1
6e8954672f
feat: add .gitignore file for Swift 2023-01-02 21:40:19 +08:00
Yudong Jin
f2e9e8f28f
Merge pull request #186 from sjinzh/master 
add zig code for chapter_computational_complexity (Zig Version 0.10.0)
 2023-01-02 21:38:57 +08:00
Yudong Jin
410c5d6b62 Free memory after removing 
a node from a LinkedList or TreeNode.
 2023-01-02 19:53:55 +08:00
Yudong Jin
6b02449f22 Update the chapter sorting (Go code). 2023-01-02 19:09:46 +08:00
Yudong Jin
5cb62fd458 Update the array (Go code). 2023-01-02 19:03:36 +08:00
Yudong Jin
1f1c58519d Update the array and linked list (Go code). 2023-01-02 18:59:35 +08:00
Yudong Jin
fd4737ef45
Merge pull request #188 from Cathay-Chen/master 
Add the Go code to array and linked_list docs (Chapter of Array and LinkedList)
 2023-01-02 18:53:40 +08:00
Yudong Jin
82b8a5da39
Merge branch 'master' into master 2023-01-02 18:53:33 +08:00
Yudong Jin
bacf8553c5
Update linked_list.go 2023-01-02 18:42:58 +08:00
Yudong Jin
679d5314d9
Update linked_list.md 2023-01-02 18:41:21 +08:00
nuomi1
57bd711779
feat: add Swift codes for space complexity article 2023-01-01 21:29:45 +08:00
Yudong Jin
5ea660a2da
Merge pull request #190 from GN-Yu/patch-1 
Suggestion on merge_sort.md
 2022-12-31 02:25:04 +08:00
GN-Yu
327b566ff9
Update merge_sort.ts 2022-12-30 13:23:26 -05:00
GN-Yu
506bc009c7
Update merge_sort.py 2022-12-30 13:22:59 -05:00
GN-Yu
96355afb1c
Update merge_sort.js 2022-12-30 13:22:31 -05:00
GN-Yu
6ba808ed36
Update merge_sort.java 2022-12-30 13:22:07 -05:00
GN-Yu
5d45f71167
Update merge_sort.go 2022-12-30 13:21:40 -05:00
GN-Yu
1b71e74baa
Update merge_sort.cs 2022-12-30 13:21:03 -05:00
GN-Yu
a03353f8e2
Update merge_sort.cpp 2022-12-30 13:20:25 -05:00
GN-Yu
af0ce1f344
Merge branch 'krahets:master' into patch-1 2022-12-30 13:19:21 -05:00
Yudong Jin
970410a7c3
Merge pull request #195 from hezhizhen/typo 
fix typo
 2022-12-31 02:02:16 +08:00
sjinzh
56b4d2de8b
Merge branch 'krahets:master' into master 2022-12-30 22:47:25 +08:00
Zhizhen He
507f07ac4b
fix typo 2022-12-30 18:37:12 +08:00
Yudong Jin
0950e43fd7
Merge pull request #178 from guowei-gong/gongguowei 
docs(array): sample code for golang
 2022-12-30 16:46:18 +08:00
Yudong Jin
e5497496f9
Update array.md 2022-12-30 16:45:40 +08:00
Yudong Jin
ae78126d80
Update array.go 2022-12-30 16:44:09 +08:00
Yudong Jin
f2f476a578
Merge pull request #191 from L-Super/patch-1 
Add insertion sort in C
 2022-12-30 16:37:53 +08:00
Yudong Jin
88dfc389b8
Merge pull request #192 from Wonderdch/patch-1 
添加 C# 内置的双向队列示例
 2022-12-30 16:12:07 +08:00
Yudong Jin
56b6bf10f8
Update deque.md 2022-12-30 16:11:47 +08:00
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