{"id":15034608,"url":"https://github.com/mayuanucas/mygo","last_synced_at":"2025-04-09T22:52:22.867Z","repository":{"id":57543429,"uuid":"124230337","full_name":"mayuanucas/mygo","owner":"mayuanucas","description":"Leetcode、剑指offer(第二版)的Go实现😀 Come join us！🤝❤️👻","archived":false,"fork":false,"pushed_at":"2020-01-29T14:47:11.000Z","size":4784,"stargazers_count":125,"open_issues_count":0,"forks_count":29,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-09T22:52:15.505Z","etag":null,"topics":["algorithm","algorithms","go","go-examples","go-tutorial","go-tutorials","golang","golang-examples","golang-tutorial","golang-tutorials","leetcode","swordforoffer"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mayuanucas.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-03-07T12:06:22.000Z","updated_at":"2025-03-26T06:50:30.000Z","dependencies_parsed_at":"2022-08-27T19:10:38.176Z","dependency_job_id":null,"html_url":"https://github.com/mayuanucas/mygo","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/mayuanucas%2Fmygo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mayuanucas%2Fmygo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mayuanucas%2Fmygo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mayuanucas%2Fmygo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mayuanucas","download_url":"https://codeload.github.com/mayuanucas/mygo/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248125641,"owners_count":21051766,"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","algorithms","go","go-examples","go-tutorial","go-tutorials","golang","golang-examples","golang-tutorial","golang-tutorials","leetcode","swordforoffer"],"created_at":"2024-09-24T20:25:40.723Z","updated_at":"2025-04-09T22:52:22.815Z","avatar_url":"https://github.com/mayuanucas.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"## mygo\n\n\u003e 此项目建议搭配[Code tree for GitHub](https://github.com/buunguyen/octotree)效果更佳。\n\u003e \n\u003e ##### 环境\n\u003e \n\u003e go1.10 darwin/amd64\n\n### Leetcode\n\n使用 Go 解答 Leetcode 题目。[链接](/algorithm/leetcode)\n\n| 题号  | 题目   | 难度  |\n|:---:|:---- |:---:|\n| 1   | [两数之和](algorithm/leetcode/001) | 简单  |\n| 7   | [反转整数](algorithm/leetcode/007) | 简单  |\n| 9   | [回文数](algorithm/leetcode/009) | 简单  |\n| 13   | [罗马数字转整数](algorithm/leetcode/013) | 简单  |\n| 14   | [最长公共前缀](algorithm/leetcode/014) | 简单  |\n| 20   | [有效的括号](algorithm/leetcode/020) | 简单  |\n| 21   | [合并两个有序链表](algorithm/leetcode/021) | 简单  |\n| 26   | [删除排序数组中的重复项](algorithm/leetcode/026) | 简单  |\n| 27   | [移除元素](algorithm/leetcode/027) | 简单  |\n| 28   | [实现strStr()](algorithm/leetcode/028) | 简单  |\n| 35   | [搜索插入位置](algorithm/leetcode/035) | 简单  |\n| 38   | [报数](algorithm/leetcode/038) | 简单  |\n| 53   | [最大子序和](algorithm/leetcode/053) | 简单  |\n| 58   | [最后一个单词的长度](algorithm/leetcode/058) | 简单  |\n| 66   | [加一](algorithm/leetcode/066) | 简单  |\n| 67   | [二进制求和](algorithm/leetcode/067) | 简单  |\n| 69   | [x 的平方根](algorithm/leetcode/069) | 简单  |\n| 70   | [爬楼梯](algorithm/leetcode/070) | 简单  |\n| 83   | [删除排序链表中的重复元素](algorithm/leetcode/083) | 简单  |\n| 88   | [合并两个有序数组](algorithm/leetcode/088) | 简单  |\n| 100   | [相同的树](algorithm/leetcode/100) | 简单  |\n| 101   | [对称二叉树](algorithm/leetcode/101) | 简单  |\n| 104   | [二叉树的最大深度](algorithm/leetcode/104) | 简单  |\n| 107   | [二叉树的层次遍历 II](algorithm/leetcode/107) | 简单  |\n| 108   | [将有序数组转换为二叉搜索树 ](algorithm/leetcode/108) | 简单  |\n| 110   | [平衡二叉树](algorithm/leetcode/110) | 简单  |\n| 111   | [二叉树的最小深度](algorithm/leetcode/111) | 简单  |\n| 112   | [路径总和](algorithm/leetcode/112) | 简单  |\n| 118   | [杨辉三角](algorithm/leetcode/118) | 简单  |\n| 119   | [杨辉三角 II](algorithm/leetcode/119) | 简单  |\n| 121   | [买卖股票的最佳时机](algorithm/leetcode/121) | 简单  |\n| 122   | [买卖股票的最佳时机 II](algorithm/leetcode/122) | 简单  |\n| 125   | [验证回文串](algorithm/leetcode/125) | 简单  |\n| 136   | [只出现一次的数字](algorithm/leetcode/136) | 简单  |\n| 167   | [两数之和 II - 输入有序数组](algorithm/leetcode/167) | 简单  |\n| 168   | [Excel表列名称](algorithm/leetcode/168) | 简单  |\n| 169   | [求众数](algorithm/leetcode/169) | 简单  |\n| 171   | [Excel表列序号](algorithm/leetcode/171) | 简单  |\n| 172   | [阶乘后的零](algorithm/leetcode/172) | 简单  |\n| 189   | [旋转数组](algorithm/leetcode/189) | 简单  |\n| 198   | [打家劫舍](algorithm/leetcode/198) | 简单  |\n| 202   | [快乐数](algorithm/leetcode/202) | 简单  |\n| 203   | [删除链表中的节点](algorithm/leetcode/203) | 简单  |\n| 204   | [计数质数](algorithm/leetcode/204) | 简单  |\n| 205   | [同构字符串](algorithm/leetcode/205) | 简单  |\n| 206   | [反转链表](algorithm/leetcode/206) | 简单  |\n| 217   | [存在重复元素](algorithm/leetcode/217) | 简单  |\n| 219   | [存在重复元素 II](algorithm/leetcode/219) | 简单  |\n| 226   | [翻转二叉树](algorithm/leetcode/226) | 简单  |\n| 231   | [2的幂](algorithm/leetcode/231) | 简单  |\n| 234   | [回文链表](algorithm/leetcode/234) | 简单  |\n| 258   | [各位相加](algorithm/leetcode/258) | 简单  |\n| 263   | [丑数](algorithm/leetcode/263) | 简单  |\n| 268   | [缺失数字](algorithm/leetcode/268) | 简单  |\n| 283   | [移动零](algorithm/leetcode/283) | 简单  |\n| 290   | [单词模式](algorithm/leetcode/290) | 简单  |\n| 292   | [Nim游戏](algorithm/leetcode/292) | 简单  |\n| 303   | [区域和检索 - 不可变](algorithm/leetcode/303) | 简单  |\n| 326   | [3的幂](algorithm/leetcode/326) | 简单  |\n| 342   | [4的幂](algorithm/leetcode/342) | 简单  |\n| 344   | [反转字符串](algorithm/leetcode/344) | 简单  |\n| 345   | [反转字符串中的元音字母](algorithm/leetcode/345) | 简单  |\n| 349   | [两个数组的交集](algorithm/leetcode/349) | 简单  |\n| 350   | [两个数组的交集 II](algorithm/leetcode/350) | 简单  |\n| 367   | [有效的完全平方数](algorithm/leetcode/367) | 简单  |\n| 371   | [两整数之和](algorithm/leetcode/371) | 简单  |\n| 383   | [赎金信](algorithm/leetcode/383) | 简单  |\n| 387   | [字符串中的第一个唯一字符](algorithm/leetcode/387) | 简单  |\n| 389   | [找不同](algorithm/leetcode/389) | 简单  |\n| 400   | [第N个数字](algorithm/leetcode/400) | 简单  |\n| 404   | [左叶子之和](algorithm/leetcode/404) | 简单  |\n| 405   | [数字转换为十六进制数](algorithm/leetcode/405) | 简单  |\n| 409   | [最长回文串](algorithm/leetcode/409) | 简单  |\n| 412   | [Fizz Buzz](algorithm/leetcode/412) | 简单  |\n| 414   | [第三大的数](algorithm/leetcode/414) | 简单  |\n| 415   | [字符串相加](algorithm/leetcode/415) | 简单  |\n| 434   | [字符串中的单词数](algorithm/leetcode/434) | 简单  |\n| 437   | [路径总和 III](algorithm/leetcode/437) | 简单  |\n| 438   | [找到字符串中所有字母异位词](algorithm/leetcode/438) | 简单  |\n| 441   | [排列硬币](algorithm/leetcode/441) | 简单  |\n| 443   | [压缩字符串](algorithm/leetcode/443) | 简单  |\n| 447   | [回旋镖的数量](algorithm/leetcode/447) | 简单  |\n| 448   | [找到所有数组中消失的数字](algorithm/leetcode/448) | 简单  |\n| 453   | [最小移动次数使数组元素相等](algorithm/leetcode/453) | 简单  |\n| 455   | [分发饼干](algorithm/leetcode/455) | 简单  |\n| 459   | [重复的子字符串](algorithm/leetcode/459) | 简单  |\n| 461   | [汉明距离](algorithm/leetcode/461) | 简单  |\n| 463   | [岛屿的周长](algorithm/leetcode/463) | 简单  |\n| 475   | [供暖器](algorithm/leetcode/475) | 简单  |\n| 476   | [数字的补数](algorithm/leetcode/476) | 简单  |\n| 479   | [最大回文数乘积](algorithm/leetcode/479) | 简单  |\n| 485   | [最大连续1的个数](algorithm/leetcode/485) | 简单  |\n| 492   | [构造矩形](algorithm/leetcode/492) | 简单  |\n| 496   | [下一个更大元素 I](algorithm/leetcode/496) | 简单  |\n| 500   | [键盘行](algorithm/leetcode/500) | 简单  |\n| 501   | [Find Mode in Binary Search Tree](algorithm/leetcode/501) | 简单  |\n| 504   | [七进制数](algorithm/leetcode/504) | 简单  |\n| 506   | [相对名次](algorithm/leetcode/506) | 简单  |\n| 507   | [完美数](algorithm/leetcode/507) | 简单  |\n| 520   | [检测大写字母](algorithm/leetcode/520) | 简单  |\n| 521   | [最长特殊序列 Ⅰ](algorithm/leetcode/521) | 简单  |\n| 530   | [二叉搜索树的最小绝对差](algorithm/leetcode/530) | 简单  |\n| 532   | [数组中的K-diff数对](algorithm/leetcode/532) | 简单  |\n| 538   | [把二叉搜索树转换为累加树](algorithm/leetcode/538) | 简单  |\n| 541   | [反转字符串 II](algorithm/leetcode/541) | 简单  |\n| 543   | [二叉树的直径](algorithm/leetcode/543) | 简单  |\n| 551   | [学生出勤纪录 I](algorithm/leetcode/551) | 简单  |\n| 557   | [反转字符串中的单词 III](algorithm/leetcode/557) | 简单  |\n| 561   | [数组拆分 I](algorithm/leetcode/561) | 简单  |\n| 563   | [二叉树的坡度](algorithm/leetcode/563) | 简单  |\n| 566   | [重塑矩阵](algorithm/leetcode/566) | 简单  |\n| 572   | [另一个树的子树](algorithm/leetcode/572) | 简单  |\n| 575   | [分糖果](algorithm/leetcode/575) | 简单  |\n| 581   | [最短无序连续子数组](algorithm/leetcode/581) | 简单  |\n| 594   | [最长和谐子序列](algorithm/leetcode/594) | 简单  |\n| 598   | [范围求和 II](algorithm/leetcode/598) | 简单  |\n| 599   | [两个列表的最小索引总和](algorithm/leetcode/599) | 简单  |\n| 605   | [种花问题](algorithm/leetcode/605) | 简单  |\n| 606   | [根据二叉树创建字符串](algorithm/leetcode/606) | 简单  |\n| 617   | [合并二叉树](algorithm/leetcode/617) | 简单  |\n| 628   | [三个数的最大乘积](algorithm/leetcode/628) | 简单  |\n| 633   | [平方数之和](algorithm/leetcode/633) | 简单  |\n| 637   | [二叉树的层平均值](algorithm/leetcode/637) | 简单  |\n| 643   | [子数组最大平均数 I](algorithm/leetcode/643) | 简单  |\n| 645   | [错误的集合](algorithm/leetcode/645) | 简单  |\n| 653   | [两数之和 IV - 输入 BST](algorithm/leetcode/653) | 简单  |\n| 657   | [判断路线成圈](algorithm/leetcode/657) | 简单  |\n| 661   | [图片平滑器](algorithm/leetcode/661) | 简单  |\n| 669   | [修剪二叉搜索树](algorithm/leetcode/669) | 简单  |\n| 674   | [最长连续递增序列](algorithm/leetcode/674) | 简单  |\n| 682   | [棒球比赛](algorithm/leetcode/682) | 简单  |\n| 686   | [重复叠加字符串匹配](algorithm/leetcode/686) | 简单  |\n| 687   | [最长同值路径](algorithm/leetcode/687) | 简单  |\n| 693   | [交替位二进制数](algorithm/leetcode/693) | 简单  |\n| 695   | [岛屿的最大面积](algorithm/leetcode/695) | 简单  |\n| 696   | [计数二进制子串](algorithm/leetcode/696) | 简单  |\n| 697   | [数组的度](algorithm/leetcode/697) | 简单  |\n| 717   | [1比特与2比特字符](algorithm/leetcode/717) | 简单  |\n| 724   | [寻找数组的中心索引](algorithm/leetcode/724) | 简单  |\n| 728   | [自除数](algorithm/leetcode/728) | 简单  |\n| 744   | [寻找比目标字母大的最小字母](algorithm/leetcode/744) | 简单  |\n| 746   | [使用最小花费爬楼梯](algorithm/leetcode/746) | 简单  |\n| 747   | [至少是其他数字两倍的最大数](algorithm/leetcode/747) | 简单  |\n| 762   | [二进制表示中质数个计算置位](algorithm/leetcode/762) | 简单  |\n| 766   | [托普利茨矩阵](algorithm/leetcode/766) | 简单  |\n| 771   | [宝石与石头](algorithm/leetcode/771) | 简单  |\n| 783   | [二叉搜索树结点最小距离](algorithm/leetcode/783) | 简单  |\n| 784   | [字母大小写全排列](algorithm/leetcode/784) | 简单  |\n| 788   | [旋转数字](algorithm/leetcode/788) | 简单  |\n| 796   | [旋转字符串](algorithm/leetcode/796) | 简单  |\n| 804   | [唯一摩尔斯密码词](algorithm/leetcode/804) | 简单  |\n| 811   | [子域名访问计数](algorithm/leetcode/811) | 简单  |\n| 812   | [最大三角形面积](algorithm/leetcode/812) | 简单  |\n| 821   | [字符的最短距离](algorithm/leetcode/821) | 简单  |\n| 824   | [山羊拉丁文](algorithm/leetcode/824) | 简单  |\n| 829   | [连续整数求和](algorithm/leetcode/829) | 中等  |\n| 830   | [较大分组的位置](algorithm/leetcode/830) | 简单  |\n| 832   | [翻转图像](algorithm/leetcode/832) | 简单  |\n| 836   | [矩形重叠](algorithm/leetcode/836) | 简单  |\n| 840   | [矩阵中的幻方](algorithm/leetcode/840) | 简单  |\n| 844   | [比较含退格的字符串](algorithm/leetcode/844) | 简单  |\n\n\n### 剑指offer(第二版)\n\n使用 Go 解答 剑指offer 题目。[链接](/algorithm/sfo)\n\n### Go 语言笔记\n\n学习 Go 语言过程中做的笔记。[链接](/notes)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmayuanucas%2Fmygo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmayuanucas%2Fmygo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmayuanucas%2Fmygo/lists"}