{"id":20037359,"url":"https://github.com/aldenhovel/i-love-coding","last_synced_at":"2025-05-05T06:30:46.740Z","repository":{"id":63088244,"uuid":"562891116","full_name":"Aldenhovel/i-love-coding","owner":"Aldenhovel","description":"Collections of code, Python, C/C++, JavaScript/TypeScript/Vue .","archived":false,"fork":false,"pushed_at":"2024-12-13T05:39:47.000Z","size":23044,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-08T18:40:05.702Z","etag":null,"topics":["cpp","csharp","javascript","leetcode","python","typescript"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Aldenhovel.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-11-07T13:27:54.000Z","updated_at":"2024-12-13T05:39:52.000Z","dependencies_parsed_at":"2024-11-13T10:30:00.528Z","dependency_job_id":null,"html_url":"https://github.com/Aldenhovel/i-love-coding","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aldenhovel%2Fi-love-coding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aldenhovel%2Fi-love-coding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aldenhovel%2Fi-love-coding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aldenhovel%2Fi-love-coding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Aldenhovel","download_url":"https://codeload.github.com/Aldenhovel/i-love-coding/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252451355,"owners_count":21749925,"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":["cpp","csharp","javascript","leetcode","python","typescript"],"created_at":"2024-11-13T10:19:12.240Z","updated_at":"2025-05-05T06:30:44.368Z","avatar_url":"https://github.com/Aldenhovel.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 代码分类\n- [:four_leaf_clover: Python](https://github.com/Aldenhovel/i-love-coding/tree/main/py)\n- [:cake: C / C++](https://github.com/Aldenhovel/i-love-coding/tree/main/cpp)\n- [:pineapple: JavaScript / Vue.js](https://github.com/Aldenhovel/i-love-coding/tree/main/js)\n- [:airplane: C#](https://github.com/Aldenhovel/i-love-coding/tree/main/cs)\n- [:rocket: TypeScript](https://github.com/Aldenhovel/i-love-coding/tree/main/ts)\n\n## 题目\n### Easy\n- [剑指 Offer II 032. 有效的变位词](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/offer032.md)\n- [1629. 按键持续时间最长的键](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1629.md)\n- [1827. 最少操作使数组递增](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1827.md)\n- [1758. 生成交替二进制字符串的最少操作数](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1758.md)\n- [605. 种花问题](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/605.md)\n- [2269. 找到一个数字的 K 美丽值](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/2269.md)\n- [401. 二进制手表](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/401.md)\n- [1909. 删除一个元素使数组严格递增](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1909.md)\n- [118. 杨辉三角](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/118.md)\n- [LCP 01. 猜数字](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/LCP01.md)\n- [867. 转置矩阵](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/867.md)\n- [LCP 02. 分式化简](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/LCP02.md)\n- [1684. 统计一致字符串的数目](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1684.md)\n- [226. 翻转二叉树](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/226.md)\n- [1688.比赛中的配对次数](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1688.md)\n- [1752. 检查数组是否经排序和轮转得到](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1752.md)\n- [1652. 拆炸弹](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1652.md)\n- [844. 比较含退格的字符串](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/844.md)\n- [145.二叉树的后序遍历](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/145.md)\n- [35. 搜索插入位置](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/35.md)\n- [70. 爬楼梯](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/70.md)\n- [202. 快乐数](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/202.md)\n- [349. 两个数组的交集](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/349.md)\n- [860. 柠檬水找零](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/860.md)\n\n### Medium\n- [面试题 17.11. 单词距离](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/mst17.11.md)\n- [858. 镜面反射](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/858.md)\n- [1759. 统计同构子字符串的数目](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1759.md)\n- [剑指 Offer II 049. 从根节点到叶节点的路径数字之和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/offer049.md)\n- [1024. 视频拼接](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1024.md)\n- [229. 多数元素 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/229.md)\n- [454. 四数相加 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/454.md)\n- [117. 填充每个节点的下一个右侧节点指针 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/117.md)\n- [416. 分割等和子集](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/416.md)\n- [2. 两数相加](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/2.md)\n- [3.无重复字符的最长子串](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/3.md)\n- [18.四数之和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/18.md)\n- [139.单词拆分](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/139.md)\n- [5.最长回文子串](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/5.md)\n- [98.验证二叉搜索树](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/98.md)\n- [1552. 两球之间的磁力](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1552.md)\n- [1855. 下标对中的最大距离](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1855.md)\n- [384. 打乱数组](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/384.md)\n- [429. N 叉树的层序遍历](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/429.md)\n- [15.三数之和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/15.md)\n- [2545.根据第 K 场考试的分数排序](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/2545.md)\n- [55.跳跃游戏](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/55.md)\n- [62.不同路径](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/62.md)\n- [863.二叉树中所有距离为 K 的结点](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/863.md)\n- [886.可能的二分法](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/886.md)\n- [979.在二叉树中分配硬币](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/979.md)\n- [63. 不同路径 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/63.md)\n- [64. 最小路径和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/64.md)\n- [120. 三角形最小路径和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/120.md)\n- [931. 下降路径最小和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/931.md)\n- [49. 字母异位词分组](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/49.md)\n- [6. N 字形变换](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/6.md)\n- [50. Pow(x, n)](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/50.md)\n- [494. 目标和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/494.md)\n- [1911. 最大子序列交替和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1911.md)\n\n### Hard\n\n- [1289](https://github.com/Aldenhovel/i-love-coding/blob/main/hard/1289.md)\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faldenhovel%2Fi-love-coding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faldenhovel%2Fi-love-coding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faldenhovel%2Fi-love-coding/lists"}