{"id":19243117,"url":"https://github.com/sangyx/algorithm","last_synced_at":"2025-02-23T14:44:57.523Z","repository":{"id":108324990,"uuid":"168488217","full_name":"sangyx/algorithm","owner":"sangyx","description":"算法题打卡记录","archived":false,"fork":false,"pushed_at":"2020-07-31T13:27:02.000Z","size":233,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-05T03:42:15.532Z","etag":null,"topics":["algorithm","c-plus-plus","leetcode-solutions","poj"],"latest_commit_sha":null,"homepage":"https://www.sangyx.cn/category/work/alg","language":"C++","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/sangyx.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":"2019-01-31T08:15:05.000Z","updated_at":"2020-07-31T13:27:04.000Z","dependencies_parsed_at":null,"dependency_job_id":"e9d0fb8e-c2a5-4234-b866-4619d98c2cb3","html_url":"https://github.com/sangyx/algorithm","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/sangyx%2Falgorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sangyx%2Falgorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sangyx%2Falgorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sangyx%2Falgorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sangyx","download_url":"https://codeload.github.com/sangyx/algorithm/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240331313,"owners_count":19784644,"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":["algorithm","c-plus-plus","leetcode-solutions","poj"],"created_at":"2024-11-09T17:16:44.154Z","updated_at":"2025-02-23T14:44:57.518Z","avatar_url":"https://github.com/sangyx.png","language":"C++","readme":"# algorithm\n\u003e 刷题打卡记录\n\n### Array题解\n* [11.Container With Most Water](https://www.sangyx.cn/825)\n* [18.4Sum](https://www.sangyx.cn/836)\n* [31.Next Permutation](https://www.sangyx.cn/913)\n* [33.Search in Rotated Sorted Array](https://www.sangyx.cn/947)\n* [34.Find First and Last Position of Element in Sorted Array](https://www.sangyx.cn/951)\n* [35.Search Insert Position](https://www.sangyx.cn/823)\n* [41.First Missing Positive](https://www.sangyx.cn/840)\n* [48.Rotate Image](https://www.sangyx.cn/954)\n* [55.Jump Game](https://www.sangyx.cn/871)\n* [56.Merge Intervals](https://www.sangyx.cn/957)\n* [59.Spiral Matrix II](https://www.sangyx.cn/876)\n* [73.Set Matrix Zeroes](https://www.sangyx.cn/960)\n* [75.Sort Colors](https://www.sangyx.cn/1001)\n\n### Dynamic Programming题解\n* [63.Unique Paths II](https://www.sangyx.cn/878)\n* [64.Minimum Path Sum](https://www.sangyx.cn/884)\n* [375.Guess Number Higher or Lower II](https://www.sangyx.cn/1143)\n* [376.Wiggle Subsequence](https://www.sangyx.cn/1140)\n* [576.Out of Boundary Paths](https://www.sangyx.cn/1361)\n* [714.Best Time to Buy and Sell Stock with Transaction Fee](https://www.sangyx.cn/1371)\n* [877.Stone Game](https://www.sangyx.cn/1461)\n\n### Graph题解\n* [310.Minimum Height Trees](https://www.sangyx.cn/1340)\n\n### Stack题解\n* [1209.Remove All Adjacent Duplicates in String II](https://www.sangyx.cn/1396)\n\n### String题解\n* [1247.Minimum Swaps to Make Strings Equal](https://www.sangyx.cn/1447)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsangyx%2Falgorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsangyx%2Falgorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsangyx%2Falgorithm/lists"}