Impressum
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.
Breadcrumb
Hero Section / Greeter
This exampleSite is deployed on Github Pages within it’s theme repository.
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
Integer nec posuere quam. Mauris et rhoncus lacus. Pellentesque non sem cursus, interdum nunc ut, efficitur magna. Maecenas consectetur ornare enim, nec tempus tellus vestibulum in. Orci varius natoque penatibus et magnis dis parturient montes, nascetur ridiculus mus. Vestibulum venenatis ex non auctor malesuada. Curabitur semper elit sit amet orci facilisis fermentum. Nullam consectetur risus eget leo rhoncus egestas. Suspendisse at diam congue, venenatis augue et, ornare lectus. Curabitur ac lorem ullamcorper, consequat justo at, scelerisque lacus. Vivamus ac erat mauris. Nullam ut nibh tincidunt, placerat magna nec, fermentum tortor. Fusce ut orci sed neque sagittis rhoncus. Morbi eleifend, mauris sit amet dignissim dignissim, mauris nisi tempus orci, a congue elit ex quis ex.
— Lorem Ipsum
關於我 About Me
黃仕璿 Aionyx
國立臺灣科技大學 資訊工程系 NTUST CSIE
目前專注於程式開發與演算法學習 歡迎來到我的技術空間
聯繫與連結
GitHub https://github.com/aionyx02
LeetCode https://leetcode.cn/u/aionyx/
Discord aionyxhuang.
Email aionyxhuang@gmail.com
歡迎隨時透過上述方式與我互相討論技術問題 讓我們一起交流進步
Example Links
Example Link 1 Example Link 2 Example Link 3 Example Link 4
More Links
More Link 1 More Link 2 More Link 3
Aionyx Release News
專長 C++ / C
專案類型
演算法與資料結構實作 包含各種排序演算法與樹狀結構的效能優化
系統程式開發 針對底層邏輯與記憶體管理的實務練習
競賽程式競賽題解 LeetCode 與各類程式平台的高效能練習
工具程式開發 開發提升開發效率的小型 CLI 工具
最新動態
正在優化個人的 GitHub 專案庫 持續更新 LeetCode 刷題進度
歡迎關注我的 GitHub 獲取最新代碼更新
Donate
Welcome to Donate! Select the item you want to
support.
Your contribution helps keep the project alive.
O(1) Constant Support | $5 (was $10) Balanced Tree Node | $15 (was $20) Dijkstra's Shortest Path | $35 (was $40) Dynamic Programming Table | $80 (was $100) Optimal Substructure | $500 (was $600) NP-Hard Problem Solver | $1,000 (was $1,200)