Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/aldenhovel/i-love-coding
Collections of code, Python, C/C++, JavaScript/TypeScript/Vue .
https://github.com/aldenhovel/i-love-coding
cpp csharp javascript leetcode python typescript
Last synced: about 1 month ago
JSON representation
Collections of code, Python, C/C++, JavaScript/TypeScript/Vue .
- Host: GitHub
- URL: https://github.com/aldenhovel/i-love-coding
- Owner: Aldenhovel
- Created: 2022-11-07T13:27:54.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2023-08-08T06:06:54.000Z (over 1 year ago)
- Last Synced: 2023-08-08T07:30:28.610Z (over 1 year ago)
- Topics: cpp, csharp, javascript, leetcode, python, typescript
- Language: Jupyter Notebook
- Homepage:
- Size: 22 MB
- Stars: 5
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
## 代码分类
- [:four_leaf_clover: Python](https://github.com/Aldenhovel/i-love-coding/tree/main/py)
- [:cake: C / C++](https://github.com/Aldenhovel/i-love-coding/tree/main/cpp)
- [:pineapple: JavaScript / Vue.js](https://github.com/Aldenhovel/i-love-coding/tree/main/js)
- [:airplane: C#](https://github.com/Aldenhovel/i-love-coding/tree/main/cs)
- [:rocket: TypeScript](https://github.com/Aldenhovel/i-love-coding/tree/main/ts)## 题目
### Easy
- [剑指 Offer II 032. 有效的变位词](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/offer032.md)
- [1629. 按键持续时间最长的键](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1629.md)
- [1827. 最少操作使数组递增](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1827.md)
- [1758. 生成交替二进制字符串的最少操作数](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1758.md)
- [605. 种花问题](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/605.md)
- [2269. 找到一个数字的 K 美丽值](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/2269.md)
- [401. 二进制手表](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/401.md)
- [1909. 删除一个元素使数组严格递增](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1909.md)
- [118. 杨辉三角](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/118.md)
- [LCP 01. 猜数字](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/LCP01.md)
- [867. 转置矩阵](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/867.md)
- [LCP 02. 分式化简](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/LCP02.md)
- [1684. 统计一致字符串的数目](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1684.md)
- [226. 翻转二叉树](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/226.md)
- [1688.比赛中的配对次数](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1688.md)
- [1752. 检查数组是否经排序和轮转得到](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1752.md)
- [1652. 拆炸弹](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/1652.md)
- [844. 比较含退格的字符串](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/844.md)
- [145.二叉树的后序遍历](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/145.md)
- [35. 搜索插入位置](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/35.md)
- [70. 爬楼梯](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/70.md)
- [202. 快乐数](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/202.md)
- [349. 两个数组的交集](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/349.md)
- [860. 柠檬水找零](https://github.com/Aldenhovel/i-love-coding/blob/main/easy/860.md)### Medium
- [面试题 17.11. 单词距离](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/mst17.11.md)
- [858. 镜面反射](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/858.md)
- [1759. 统计同构子字符串的数目](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1759.md)
- [剑指 Offer II 049. 从根节点到叶节点的路径数字之和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/offer049.md)
- [1024. 视频拼接](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1024.md)
- [229. 多数元素 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/229.md)
- [454. 四数相加 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/454.md)
- [117. 填充每个节点的下一个右侧节点指针 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/117.md)
- [416. 分割等和子集](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/416.md)
- [2. 两数相加](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/2.md)
- [3.无重复字符的最长子串](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/3.md)
- [18.四数之和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/18.md)
- [139.单词拆分](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/139.md)
- [5.最长回文子串](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/5.md)
- [98.验证二叉搜索树](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/98.md)
- [1552. 两球之间的磁力](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1552.md)
- [1855. 下标对中的最大距离](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1855.md)
- [384. 打乱数组](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/384.md)
- [429. N 叉树的层序遍历](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/429.md)
- [15.三数之和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/15.md)
- [2545.根据第 K 场考试的分数排序](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/2545.md)
- [55.跳跃游戏](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/55.md)
- [62.不同路径](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/62.md)
- [863.二叉树中所有距离为 K 的结点](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/863.md)
- [886.可能的二分法](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/886.md)
- [979.在二叉树中分配硬币](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/979.md)
- [63. 不同路径 II](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/63.md)
- [64. 最小路径和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/64.md)
- [120. 三角形最小路径和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/120.md)
- [931. 下降路径最小和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/931.md)
- [49. 字母异位词分组](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/49.md)
- [6. N 字形变换](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/6.md)
- [50. Pow(x, n)](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/50.md)
- [494. 目标和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/494.md)
- [1911. 最大子序列交替和](https://github.com/Aldenhovel/i-love-coding/blob/main/medium/1911.md)### Hard
- [1289](https://github.com/Aldenhovel/i-love-coding/blob/main/hard/1289.md)