{"id":21597551,"url":"https://github.com/ihengshuai/leetcode-daily","last_synced_at":"2025-08-26T23:31:31.313Z","repository":{"id":138812397,"uuid":"471938862","full_name":"ihengshuai/leetcode-daily","owner":"ihengshuai","description":"Daily algorithm training at leetcode","archived":false,"fork":false,"pushed_at":"2024-10-11T10:49:40.000Z","size":80,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"Java-version","last_synced_at":"2025-07-24T09:17:10.941Z","etag":null,"topics":["algorithms-and-data-structures","leetcode-javascript"],"latest_commit_sha":null,"homepage":"https://blog.usword.cn","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/ihengshuai.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-03-20T09:55:53.000Z","updated_at":"2024-10-21T00:15:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"137d1f6c-a63d-45f1-bb7b-2a27105dc1ee","html_url":"https://github.com/ihengshuai/leetcode-daily","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ihengshuai/leetcode-daily","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ihengshuai%2Fleetcode-daily","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ihengshuai%2Fleetcode-daily/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ihengshuai%2Fleetcode-daily/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ihengshuai%2Fleetcode-daily/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ihengshuai","download_url":"https://codeload.github.com/ihengshuai/leetcode-daily/tar.gz/refs/heads/Java-version","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ihengshuai%2Fleetcode-daily/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272267218,"owners_count":24903639,"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","status":"online","status_checked_at":"2025-08-26T02:00:07.904Z","response_time":60,"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":["algorithms-and-data-structures","leetcode-javascript"],"created_at":"2024-11-24T18:09:17.289Z","updated_at":"2025-08-26T23:31:31.236Z","avatar_url":"https://github.com/ihengshuai.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Daily algorithm training\n\n\u003e The project commits to submitting one problem\n\u003e a day, ranging in type from easy to difficult.\n\nLet's challenge together!!\n\n## catalogue\n\n\u003e Punch cards according to different difficulty levels\n\n### For simple\n\n- [x] `#1` 两数之和：TwoSum\n- [x] `#9` 回文数：PalindRome\n- [x] `#13` 罗马数字转整数 RomanToInt\n- [x] `#14` 最长公共前缀 LongestCommonPrefix\n- [x] `#20` 有效的括号 ValidBracket\n- [x] `#21` 合并两个有序链表 MergeTwoList\n- [x] `#26` 删除有序数组中的重复项 RemoveDuplicates\n- [x] `#27` 移除元素 RemoveElement\n- [x] `#28` 实现strStr()函数 StrStr\n- [x] `#35` 搜索插入位置 SearchInsert\n- [x] `#53` 最大子数组和 MaxSubArray\n- [x] `#58` 最后一个单词的长度 LengthOfLastWord\n- [x] `#66` 加一 PlusOne\n- [x] `#67` 二进制求和 AddBinary\n- [x] `#69` x的平方根 MySqrt\n- [x] `#70` 爬楼梯 ClimbStairs\n- [x] `#83` 删除排序链表中的重复元素 DeleteDuplicates\n- [x] `#88` 合并两个有序数组 MergeSortedArray\n- [x] `#94` 二叉树的中序遍历 InorderTraversal\n- [x] `#100` 相同的树 IsSameTree\n- [x] `#101` 对称二叉树 IsSymmetricTree\n- [x] `#104` 二叉树的最大深度 MaxTreeDepth\n- [x] `#108` 将有序数组转换为二叉搜索树 SortedArrayToBST\n- [x] `#110` 平衡二叉树 IsBalancedTree\n- [x] `#111` 二叉树的最小深度 MinTreeDepth\n- [x] `#112` 路径总和 HasPathSum\n- [x] `#118` 杨辉三角 YangHuiTriangle\n- [x] `#119` 杨辉三角2 YangHuiTriangle2\n- [x] `#121` 买卖股票的最佳时机 MaxProfit\n- [x] `#125` 验证回文串 IsPalindrome\n- [x] `#136` 只出现一次的数字 AppearOnceNumber\n- [x] `#141` 环形链表 HasCycleLinkList\n- [x] `#144` 二叉树的前序遍历 PreorderTraversal\n- [x] `#145` 二叉树的后序遍历 PostorderTraversal\n- [x] `#155` 最小栈 MinStack\n- [x] `#160` 相交链表 GetIntersectionNode\n\n## Sorting algorithm\nsort algorithm in folder sort.（https://visualgo.net/zh）\n\n- [x] 冒泡排序 BubbleSort\n- [x] 选择排序 SelectSort\n- [x] 插入排序 InsertSort","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fihengshuai%2Fleetcode-daily","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fihengshuai%2Fleetcode-daily","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fihengshuai%2Fleetcode-daily/lists"}