-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
24 changed files
with
619 additions
and
165 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,5 @@ | ||
/resources/ | ||
.hugo_build.lock | ||
/content-org/images/ | ||
/drawio/ | ||
*.aria2 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,25 +1,14 @@ | ||
* My Blog Source | ||
* Welcome! | ||
|
||
This is my blog source repo, which generates [[https://k4i.top][my site]] using hugo. | ||
This is the source my blog: [[https://k4i.top][k4i.top]]. | ||
|
||
** TODO Ideas [0/7] | ||
* Pipeline | ||
|
||
+ [ ] 通过各个顺序遍历的结果恢复二叉树 | ||
+ [ ] 拓扑排序 | ||
+ [Kahn’s algorithm, track indegree of nodes](https://www.geeksforgeeks.org/topological-sorting-indegree-based-solution/) | ||
+ [dfs + stack](https://www.geeksforgeeks.org/topological-sorting/) | ||
+ [All Topological Sorts](https://www.geeksforgeeks.org/all-topological-sorts-of-a-directed-acyclic-graph/) | ||
+ [ ] parse pcap with c/c++ | ||
+ [ ] Modular multiplicative inverse, The multiplicative inverse | ||
of “a modulo m” exists if and only if a and m are relatively prime (i.e., | ||
if gcd(a, m) = 1), three ways. | ||
+ Extended Euclidean algorithms | ||
+ Fermats’s little theorem (special case of Euler's theorem) | ||
+ Finding the modular inverse for every number modulo m | ||
+ refs: | ||
+ [Modular Multiplicative Inverse](https://cp-algorithms.com/algebra/module-inverse.html) | ||
+ [wiki: Modular multiplicative inverse](https://en.wikipedia.org/wiki/Modular_multiplicative_inverse) | ||
+ [ ] ways to calculate combinations | ||
+ [ ] minimax | ||
+ [ ] gRPC | ||
|
||
1. Write all my blogs in org mode, stored under [[blog-src/content-org][./blog-src/content-org]] | ||
2. Export them to markdown files ([[blog-src/content][./blog-src/content]]) with [[https://github.com/kaushalmodi/ox-hugo][ox-hugo]] | ||
3. Generate html files with [[https://gohugo.io/][hugo]] ([[https://github.com/sky-bro/blog-src/blob/master/.github/workflows/gh-pages.yml][github action]]) | ||
|
||
* Writing Guide | ||
|
||
- [[https://k4i.top/posts/writing-guide-org-plus-ox-hugo/][Writing Guide (org + ox-hugo)]] - new, write =.org= files | ||
- [[https://k4i.top/posts/writing-guide/][Writing Guide]] - old, write =.md= files |
Oops, something went wrong.
d2b3d46
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Successfully deployed to the following URLs:
blog-src – ./
k4i.top
blog-src-git-master-ky13.vercel.app
blog-src-ky13.vercel.app