{"id":19676240,"url":"https://github.com/seth-shi/leet-code","last_synced_at":"2026-06-09T04:33:24.770Z","repository":{"id":43176718,"uuid":"170655927","full_name":"seth-shi/leet-code","owner":"seth-shi","description":"记录 LeetCode !!!","archived":false,"fork":false,"pushed_at":"2022-03-15T08:58:53.000Z","size":973,"stargazers_count":2,"open_issues_count":1,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-04-13T03:49:42.521Z","etag":null,"topics":["binary-search-tree","hashmap","leet-code","linked-list","php"],"latest_commit_sha":null,"homepage":null,"language":"PHP","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/seth-shi.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}},"created_at":"2019-02-14T08:32:37.000Z","updated_at":"2020-02-25T12:55:05.000Z","dependencies_parsed_at":"2022-09-10T13:41:18.061Z","dependency_job_id":null,"html_url":"https://github.com/seth-shi/leet-code","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/seth-shi/leet-code","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seth-shi%2Fleet-code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seth-shi%2Fleet-code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seth-shi%2Fleet-code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seth-shi%2Fleet-code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/seth-shi","download_url":"https://codeload.github.com/seth-shi/leet-code/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seth-shi%2Fleet-code/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34092260,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-09T02:00:06.510Z","response_time":63,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["binary-search-tree","hashmap","leet-code","linked-list","php"],"created_at":"2024-11-11T17:27:50.025Z","updated_at":"2026-06-09T04:33:24.728Z","avatar_url":"https://github.com/seth-shi.png","language":"PHP","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 记录 LeetCode 的学习\n[可视化算法搜索](http://search.shiguopeng.cn)\n\n## 题目列表\n* [可视化算法](visual)\n* 链表\n    * 单链表\n        * [设计链表](LinkedList/SinglyLinkedList/DesignLinkedList.php)\n    * 双指针技巧\n        * [环形链表](LinkedList/TwoPointerTechnique/LinkedListCycle.c)\n        * [环形链表II](LinkedList/TwoPointerTechnique/LinkedListCycleII.c)\n        * [相交链表](LinkedList/TwoPointerTechnique/IntersectionLinkedLists.c)\n        * [删除链表的倒数第N个节点](LinkedList/TwoPointerTechnique/RemoveNthNodeFromEndOfList.c)\n    * 经典问题\n        * [反转链表(迭代)](LinkedList/ClassicProblems/ReverseLinkedList.c)\n        * [反转链表(递归)](LinkedList/ClassicProblems/ReverseLinkedListII.c)\n        * [奇偶链表](LinkedList/ClassicProblems/OddEvenLinkedList.c)\n    * 双链表    \n        * [设计链表](LinkedList/DoublyLinkedList/DesignLinkedList.php)\n    * 小结\n        * [合并两个有序链表](LinkedList/Conclusion/MergeTwoSortedLists.php)\n        * [两数相加](LinkedList/Conclusion/AddTwoNumbers.php)\n        * [扁平化多级双向链表](LinkedList/Conclusion/FlattenAMultilevelDoublyLinkedList.php)\n        * [复制带随机指针的链表](LinkedList/Conclusion/CopyListWithRandomPointer.php)\n        * [旋转链表](LinkedList/Conclusion/RotateList.php)\n* 队列和栈\n    * 队列:先入先出的数据结构    \n        * [设计循环队列](QueueAndStack/QueueFirstInFirstOut/DesignCircularQueue.php)\n        * [岛屿的个数(BFS)](QueueAndStack/QueueFirstInFirstOut/NumberOfIslands.php)\n        * [打开转盘锁](QueueAndStack/QueueFirstInFirstOut/OpenTheLock.php)\n        * [完全平方数](QueueAndStack/QueueFirstInFirstOut/PerfectSquares.php)\n    * 栈:后入先出的数据结构    \n        * [最小栈](QueueAndStack/StackLastInFirstOut/MinStack.php)\n        * [有效的括号](QueueAndStack/StackLastInFirstOut/ValidParentheses.php)\n        * [每日温度](QueueAndStack/StackLastInFirstOut/DailyTemperatures.php)\n        * [逆波兰表达式求值](QueueAndStack/StackLastInFirstOut/EvaluateReversePolishNotation.php)\n    * 栈和深度优先搜索\n        * [岛屿的个数(DFS)](QueueAndStack/StackAndDFS/NumberOfIslands.php)\n        * [克隆图](QueueAndStack/StackAndDFS/CloneGraph.php)\n        * [目标和](QueueAndStack/StackAndDFS/TargetSum.c)\n        * [二叉树的中序遍历](QueueAndStack/StackAndDFS/BinaryTreeInorderTraversal.php)\n    * 小结\n        * [用栈实现队列](QueueAndStack/Conclusion/ImplementQueueUsingStacks.php)\n        * [用队列实现栈](QueueAndStack/Conclusion/ImplementStackUsingQueues.php)\n* 哈希表\n    * 设计哈希表\n        * [设计哈希集合](HashTable/DesignHashTable/DesignHashSet.php)\n        * [设计哈希映射](HashTable/DesignHashTable/DesignHashMap.php)\n    * 哈希集合\n        * [存在重复元素](HashTable/DesignHashTable/ContainsDuplicate.php)\n        * [只出现一次的数字](HashTable/DesignHashTable/SingleNumber.php)\n        * [两个数组的交集](HashTable/DesignHashTable/IntersectionOfTwoArrays.php)\n        * [快乐数](HashTable/DesignHashTable/HappyNumber.php)\n    * 哈希映射\n        * [两数之和](HashTable/HashMap/TwoSum.php)\n        * [同构字符串](HashTable/HashMap/IsomorphicStrings.php)\n        * [两个列表的最小索引总和](HashTable/HashMap/MinimumIndexSumOfTwoLists.php)\n        * [字符串中的第一个唯一字符](HashTable/HashMap/FirstUniqueCharacterInAString.php)\n        * [两个数组的交集 II](HashTable/HashMap/IntersectionOfTwoArraysII.php)\n        * [存在重复元素 II](HashTable/HashMap/ContainsDuplicateII.php)\n    * 设计键\n        * [字母异位词分组](HashTable/DesignTheKey/GroupAnagrams.php)\n        * [有效的数独](HashTable/DesignTheKey/ValidSudoku.php)\n        * [寻找重复的子树](HashTable/DesignTheKey/FindDuplicateSubtrees.php)\n    * 小结\n        * [宝石与石头](HashTable/Conclusion/JewelsAndStones.php)\n        * [无重复字符的最长子串](HashTable/Conclusion/LongestSubstringWithoutRepeatingCharacters.php)\n        * [四数相加 II](HashTable/Conclusion/SumII.php)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fseth-shi%2Fleet-code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fseth-shi%2Fleet-code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fseth-shi%2Fleet-code/lists"}