# MyLeetCode

**Repository Path**: dollaser/MyLeetCode

## Basic Information

- **Project Name**: MyLeetCode
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Apache-2.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2025-03-04
- **Last Updated**: 2025-12-22

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 日常刷题

刷题顺序：https://github.com/youngyangyang04/leetcode-master
gitee: https://gitee.com/dollaser/leetcode-master

1. 回溯，动态规划是模板题，有固定套路
2. 贪心是思路题，没有固定套路，局部最优能推全局最优就是贪心
3. 动态规划，有固定套路，有状态转移方程，介于回溯和贪心之间