{"id":13639037,"url":"https://github.com/yuanguangxin/LeetCode","last_synced_at":"2025-04-19T21:35:24.066Z","repository":{"id":38213537,"uuid":"233156210","full_name":"yuanguangxin/LeetCode","owner":"yuanguangxin","description":"LeetCode刷题记录与面试整理","archived":false,"fork":false,"pushed_at":"2024-08-17T07:55:56.000Z","size":272,"stargazers_count":7366,"open_issues_count":0,"forks_count":1880,"subscribers_count":199,"default_branch":"master","last_synced_at":"2024-10-29T15:03:13.961Z","etag":null,"topics":["leetcode","leetcode-classification","leetcode-java","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Java","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/yuanguangxin.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","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},"funding":{"custom":["https://cdn.jsdelivr.net/gh/yuanguangxin/Curriculum-Vitae/funding.jpg"]}},"created_at":"2020-01-11T01:02:02.000Z","updated_at":"2024-10-29T00:45:59.000Z","dependencies_parsed_at":"2024-09-21T02:00:28.017Z","dependency_job_id":null,"html_url":"https://github.com/yuanguangxin/LeetCode","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/yuanguangxin%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuanguangxin%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuanguangxin%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuanguangxin%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yuanguangxin","download_url":"https://codeload.github.com/yuanguangxin/LeetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":223810245,"owners_count":17206720,"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","leetcode-classification","leetcode-java","leetcode-solutions"],"created_at":"2024-08-02T01:00:56.962Z","updated_at":"2024-11-09T09:30:32.046Z","avatar_url":"https://github.com/yuanguangxin.png","language":"Java","funding_links":["https://cdn.jsdelivr.net/gh/yuanguangxin/Curriculum-Vitae/funding.jpg"],"categories":["分类","Java"],"sub_categories":["算法"],"readme":"# LeetCode题目分类与面试问题整理\n\n\u003e [English edition](/README_EN.md)\n\n## 题目分类\n\n### Hash相关\n\n- [q1_两数之和](/src/hash相关/q1_两数之和)\n- [q387_字符串中的第一个唯一字符](/src/hash相关/q387_字符串中的第一个唯一字符)\n\n### 链表操作\n\n- [q2_两数相加](/src/链表操作/q2_两数相加)\n- [q19_删除链表的倒数第N个节点](/src/链表操作/q19_删除链表的倒数第N个节点)\n- [q25_k个一组翻转链表](/src/链表操作/q25_k个一组翻转链表)\n- [q61_旋转链表](/src/链表操作/q61_旋转链表)\n- [q138_复制带随机指针的链表](/src/链表操作/q138_复制带随机指针的链表)\n- [q160_相交链表](/src/链表操作/q160_相交链表)\n- [q206_反转链表](/src/链表操作/q206_反转链表)\n\n### 双指针遍历/滑动窗口\n\n- [q3_无重复字符的最长子串](/src/双指针遍历/q3_无重复字符的最长子串)\n- [q11_盛最多水的容器](/src/双指针遍历/q11_盛最多水的容器)\n- [q15_三数之和](/src/双指针遍历/q15_三数之和)\n- [q16_最接近的三数之和](/src/双指针遍历/q16_最接近的三数之和)\n- [q26_删除排序数组中的重复项](/src/双指针遍历/q26_删除排序数组中的重复项)\n- [q42_接雨水](/src/双指针遍历/q42_接雨水)\n- [q121_买卖股票的最佳时机](/src/双指针遍历/q121_买卖股票的最佳时机)\n- [q209_长度最小的子数组](/src/双指针遍历/q209_长度最小的子数组)\n\n### 快慢指针遍历\n\n- [q141_环形链表](/src/快慢指针遍历/q141_环形链表)\n- [q202_快乐数](/src/快慢指针遍历/q202_快乐数)\n- [q876_链表的中间结点](/src/快慢指针遍历/q876_链表的中间结点)\n\n### 区间合并\n\n- [q56_合并区间](/src/区间合并/q56_合并区间)\n\n### 字符串操作\n\n- [q6_Z字形变换](/src/字符串操作/q6_Z字形变换)\n- [q14_最长公共前缀](/src/字符串操作/q14_最长公共前缀)\n- [q763_划分字母区间](/src/字符串操作/q763_划分字母区间)\n\n### 数字操作\n\n- [q7_整数反转](/src/数字操作/q7_整数反转)\n- [q8_字符串转换整数](/src/数字操作/q8_字符串转换整数)\n- [q9_回文数](/src/数字操作/q9_回文数)\n- [q43_字符串相乘](/src/数字操作/q43_字符串相乘)\n- [q172_阶乘后的零](/src/数字操作/q172_阶乘后的零)\n- [q258_各位相加](/src/数字操作/q258_各位相加)\n\n### 数组操作\n\n- [q54_螺旋矩阵](/src/数组操作/q54_螺旋矩阵)\n- [q73_矩阵置零](/src/数组操作/q73_矩阵置零)\n- [q78_子集](/src/数组操作/q78_子集)\n- [q384_打乱数组](/src/数组操作/q384_打乱数组)\n- [q581_最短无序连续子数组](/src/数组操作/q581_最短无序连续子数组)\n- [q945_使数组唯一的最小增量](/src/数组操作/q945_使数组唯一的最小增量)\n\n### 栈相关\n\n- [q20_有效的括号](/src/栈相关/q20_有效的括号)\n- [q32_最长有效括号](/src/栈相关/q32_最长有效括号)\n- [q155_最小栈](/src/栈相关/q155_最小栈)\n- [q224_基本计算器](/src/栈相关/q224_基本计算器)\n- [q232_用栈实现队列](/src/栈相关/q232_用栈实现队列)\n- [q316_去除重复字母](/src/栈相关/q316_去除重复字母)\n\n### 堆相关\n\n- [q215_数组中的第K个最大元素](/src/堆相关/q215_数组中的第K个最大元素)\n- [q347_前K个高频元素](/src/堆相关/q347_前K个高频元素)\n\n### 递归\n\n- [q21_合并两个有序链表](/src/递归/q21_合并两个有序链表)\n- [q101_对称二叉树](/src/递归/q101_对称二叉树)\n- [q104_二叉树的最大深度](/src/递归/q104_二叉树的最大深度)\n- [q226_翻转二叉树](/src/递归/q226_翻转二叉树)\n- [q236_二叉树的最近公共祖先](/src/递归/q236_二叉树的最近公共祖先)\n- [q1325_删除给定值的叶子节点](/src/递归/q1325_删除给定值的叶子节点)\n\n### 分治法/二分法\n\n- [q23_合并K个排序链表](/src/分治法/q23_合并K个排序链表)\n- [q33_搜索旋转排序数组](/src/分治法/q33_搜索旋转排序数组)\n- [q34_在排序数组中查找元素的第一个和最后一个位置](/src/分治法/q34_在排序数组中查找元素的第一个和最后一个位置)\n\n### 动态规划\n\n- [q5_最长回文子串](/src/动态规划/q5_最长回文子串)\n- [q53_最大子序和](/src/动态规划/q53_最大子序和)\n- [q62_不同路径](/src/动态规划/q62_不同路径)\n- [q64_最小路径和](/src/动态规划/q64_最小路径和)\n- [q70_爬楼梯](/src/动态规划/q70_爬楼梯)\n- [q118_杨辉三角](/src/动态规划/q118_杨辉三角)\n- [q300_最长上升子序列](/src/动态规划/q300_最长上升子序列)\n- [q1143_最长公共子序列](/src/动态规划/q1143_最长公共子序列)\n- [q1277_统计全为1的正方形子矩阵](/src/动态规划/q1277_统计全为1的正方形子矩阵)\n\n### 回溯法\n\n- [q10_正则表达式匹配](/src/回溯法/q10_正则表达式匹配)\n- [q22_括号生成](/src/回溯法/q22_括号生成)\n- [q40_组合总和2](/src/回溯法/q40_组合总和2)\n- [q46_全排列](/src/回溯法/q46_全排列)\n\n### 字典树（前缀树）\n\n- [q648_单词替换](/src/字典树/q648_单词替换)\n\n### 树的遍历\n\n- [q94_二叉树的中序遍历](/src/树的遍历/q94_二叉树的中序遍历)\n- [q102_二叉树的层次遍历](/src/树的遍历/q102_二叉树的层次遍历)\n- [q103_二叉树的锯齿形层序遍历](/src/树的遍历/q103_二叉树的锯齿形层序遍历)\n- [q110_平衡二叉树](/src/树的遍历/q110_平衡二叉树)\n- [q144_二叉树的前序遍历](/src/树的遍历/q144_二叉树的前序遍历)\n- [q145_二叉树的后序遍历](/src/树的遍历/q145_二叉树的后序遍历)\n\n### 二叉搜索树相关\n\n- [q98_验证二叉搜索树](/src/二叉搜索树相关/q98_验证二叉搜索树)\n- [q450_删除二叉搜索树中的节点](/src/二叉搜索树相关/q450_删除二叉搜索树中的节点)\n- [q701_二叉搜索树中的插入操作](/src/二叉搜索树相关/q701_二叉搜索树中的插入操作)\n\n-------\n\n## 面试问题整理\n\n- [面试问题整理](/Rocket.md)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyuanguangxin%2FLeetCode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyuanguangxin%2FLeetCode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyuanguangxin%2FLeetCode/lists"}