{"id":21269154,"url":"https://github.com/autuanliu/code-storm2019","last_synced_at":"2025-03-15T11:42:56.494Z","repository":{"id":196754878,"uuid":"170995032","full_name":"AutuanLiu/Code-Storm2019","owner":"AutuanLiu","description":"LeetCode2019","archived":false,"fork":false,"pushed_at":"2019-10-24T08:56:46.000Z","size":543,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-22T02:18:13.886Z","etag":null,"topics":["leetcode-cpp","practice-programming"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AutuanLiu.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2019-02-16T11:15:26.000Z","updated_at":"2019-10-30T16:16:41.000Z","dependencies_parsed_at":null,"dependency_job_id":"55bead02-ccd5-40b5-b592-662c8eb61b37","html_url":"https://github.com/AutuanLiu/Code-Storm2019","commit_stats":null,"previous_names":["autuanliu/code-storm2019"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AutuanLiu%2FCode-Storm2019","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AutuanLiu%2FCode-Storm2019/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AutuanLiu%2FCode-Storm2019/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AutuanLiu%2FCode-Storm2019/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AutuanLiu","download_url":"https://codeload.github.com/AutuanLiu/Code-Storm2019/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243725537,"owners_count":20337667,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["leetcode-cpp","practice-programming"],"created_at":"2024-11-21T08:07:29.926Z","updated_at":"2025-03-15T11:42:56.473Z","avatar_url":"https://github.com/AutuanLiu.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode2019\n\n1. leetcode 代码练习\n2. 剑指offer 练习题\n3. 算法与数据结构\n4. SQL\n\n## 算法\n\n### [排序算法](./CppScripts/sort)\n\n```cpp\nvoid max_heapifty(vector\u003cint\u003e\u0026 nums, int start, int end); // 调整堆\nvoid heap_sort(vector\u003cint\u003e\u0026 nums); // 堆排序\nvoid shell_sort(vector\u003cint\u003e\u0026 nums); // 希尔排序\nvoid select_sort(vector\u003cint\u003e\u0026 nums); // 选择排序\nvoid quick_sort_swap(vector\u003cint\u003e\u0026 nums, int low, int high); // 快速排序-交换元素\nvoid quick_sort(vector\u003cint\u003e\u0026 nums, int low, int high); // 快速排序\nint get_partition(vector\u003cint\u003e\u0026 nums, int low, int high); // 快速排序获得分割点\nint get_partition_swap(vector\u003cint\u003e\u0026 nums, int low, int high); // 快速排序获得分割点-交换元素\nvoid quick_sort_iteration(vector\u003cint\u003e\u0026 nums, int low, int high); // 快速排序迭代版\nvoid merge_sorted(vector\u003cint\u003e\u0026 nums, int left, int mid, int right); // 合并两个有序数组\nvoid merge_sorted_easy(vector\u003cint\u003e\u0026 nums, int left, int mid, int right); // 化简版合并两个有序数组\nvoid merge_sort(vector\u003cint\u003e\u0026 nums, int left, int right); // 归并排序\nvoid merge_sort_iteration(vector\u003cint\u003e\u0026 nums, int left, int right); // 归并排序迭代版\nvoid insert_sort(vector\u003cint\u003e\u0026 nums); // 插入排序\nvoid bubble_sort_backward(std::vector\u003cint\u003e\u0026 nums); // 冒泡排序从后往前\nvoid bubble_sort_forward(std::vector\u003cint\u003e\u0026 nums); // 冒泡排序从前往后\n```\n\n### 数组输出\n\n```cpp\ntemplate \u003ctypename T\u003e\nvoid print_vector(vector\u003cT\u003e\u0026 nums);\n\ntemplate \u003ctypename T\u003e\nvoid print_matrix(vector\u003cvector\u003cT\u003e\u003e\u0026 matrix);\n```\n\n### [libtorch](./CppScripts/torch-x) 使用案例\n\n1. Mnist [libtorch](https://pytorch.org/cppdocs/) C++ 版本\n\n### Deep Learning 实现\n\n1. [dropout](./algorithms/dropout.py)\n2. [batchnorm](./algorithms/batchnorm.py)\n3. [layernorm](./algorithms/layernorm.py)\n4. [conv2d](./algorithms/conv2d.py)\n5. [pool2d](./algorithms/pool2d.py)\n6. [numpy 实现2层的全连接网络](./algorithms/fully2.py)\n\n## 语言\n\n1. C++\n2. Python\n3. bash\n4. SQL\n\n## 信息\n\n```bash\n(torch36) λ cloc .\n     408 text files.\n     408 unique files.\n      40 files ignored.\n\nhttp://cloc.sourceforge.net v 1.64  T=0.95 s (413.7 files/s, 22707.3 lines/s)\n-------------------------------------------------------------------------------\nLanguage                     files          blank        comment           code\n-------------------------------------------------------------------------------\nC++                            187            712           6643           5978\nPython                         168            719           3015           3743\nC/C++ Header                     5             33             13            192\nJava                             5             11              1            156\nSQL                             19             47            129            111\nBourne Shell                     3             17              9             63\nCMake                            6             18             25             27\nJSON                             2              0              0             20\n-------------------------------------------------------------------------------\nSUM:                           395           1557           9835          10290\n-------------------------------------------------------------------------------\n```\n\n## Reference\n1. [MisterBooo/LeetCodeAnimation: Demonstrate all the questions on LeetCode in the form of animation.（用动画的形式呈现解LeetCode题目的思路）](https://github.com/MisterBooo/LeetCodeAnimation)\n2. [apachecn/awesome-algorithm: LeetCode, HackRank, 剑指offer, classic algorithm implementation](https://github.com/apachecn/awesome-algorithm)\n3. [billryan/algorithm-exercise: Data Structure and Algorithm notes. 数据结构与算法/leetcode/lintcode题解/](https://github.com/billryan/algorithm-exercise)\n4. [csujedihy/lc-all-solutions: My own leetcode solutions by python](https://github.com/csujedihy/lc-all-solutions)\n5. [HuberTRoy/leetCode: :pencil2: 算法相关知识储备 LeetCode with Python](https://github.com/HuberTRoy/leetCode)\n6. [xuelangZF/LeetCode: 正确的姿势，学习的态度来刷 LeetCode：高效的代码、简洁的注释、精炼的总结。](https://github.com/xuelangZF/LeetCode)\n7. [zhedahht/CodingInterviewChinese2: 《剑指Offer》第二版源代码](https://github.com/zhedahht/CodingInterviewChinese2)\n8. [C++ 语言参考 | Microsoft Docs](https://docs.microsoft.com/zh-cn/cpp/cpp/cpp-language-reference?view=vs-2017)\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fautuanliu%2Fcode-storm2019","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fautuanliu%2Fcode-storm2019","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fautuanliu%2Fcode-storm2019/lists"}