{"id":13701973,"url":"https://github.com/RichCodersAndMe/LeetCode-Solution","last_synced_at":"2025-05-05T04:30:44.034Z","repository":{"id":144589744,"uuid":"127856921","full_name":"RichCodersAndMe/LeetCode-Solution","owner":"RichCodersAndMe","description":"👑 Solution of LeetCode with Java、JavaScript、kotlin(updating)","archived":false,"fork":false,"pushed_at":"2020-04-28T01:25:31.000Z","size":7721,"stargazers_count":25,"open_issues_count":0,"forks_count":4,"subscribers_count":8,"default_branch":"master","last_synced_at":"2024-11-13T09:40:27.634Z","etag":null,"topics":["algorithms","data-structure","data-structures","leetcode","leetcode-java","leetcode-javascript","leetcode-kotlin","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://richcodersandme.github.io/LeetCode-Solution/","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/RichCodersAndMe.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,"governance":null,"roadmap":null,"authors":null}},"created_at":"2018-04-03T05:44:56.000Z","updated_at":"2024-10-23T15:07:55.000Z","dependencies_parsed_at":"2024-01-14T19:25:14.196Z","dependency_job_id":null,"html_url":"https://github.com/RichCodersAndMe/LeetCode-Solution","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/RichCodersAndMe%2FLeetCode-Solution","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RichCodersAndMe%2FLeetCode-Solution/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RichCodersAndMe%2FLeetCode-Solution/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RichCodersAndMe%2FLeetCode-Solution/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RichCodersAndMe","download_url":"https://codeload.github.com/RichCodersAndMe/LeetCode-Solution/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252439376,"owners_count":21747993,"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":["algorithms","data-structure","data-structures","leetcode","leetcode-java","leetcode-javascript","leetcode-kotlin","leetcode-solutions"],"created_at":"2024-08-02T21:00:28.628Z","updated_at":"2025-05-05T04:30:42.662Z","avatar_url":"https://github.com/RichCodersAndMe.png","language":"Java","funding_links":[],"categories":["kotlin"],"sub_categories":[],"readme":"# \u003cimg src=\"./images/logo.gif\" alt=\"LeetCode-Solution\" width=\"80\" height=\"80\" align=\"bottom\"/\u003eLeetCode-Solution\n\n本仓库为LeetCode练习题题解记录，会持续更新各种语言的题解。同时也欢迎使用各种语言的同♂好们加入此项目，为开源贡献力量。\n\n\u003e [LeetCode](https://leetcode.com/) is the best platform to help you enhance your skills, expand your knowledge and prepare for technical interviews.\n\n如果想知道各大公司 LeetCode 面试题，可以参看 [Companies.md][companies]。\n\n附上[@Blankj](https://github.com/Blankj)的镇楼诗：\n\n\u003e 明有科举八股，今有 LeetCode。  \n\u003e 八股定格式而取文采心意，LeetCode 定题目且重答案背诵。  \n\u003e 美其名曰：\"practice makes perfect.\"  \n\u003e 为何今不如古？  \n\u003e 非也非也，  \n\u003e 科举为国取士，LeetCode 为 Google 筛码工，各取所需也。  \n\n## 目录\n\n- [题解汇总](#题解汇总)\n- [库维护须知](#库维护须知)\n- [贡献者名单](#贡献者名单)\n\n## 题解汇总\n\n| 题目                 | 题解                                                         | 难度         | Java           | JavaScript   | kotlin          |\n| :-----------------: | ------------------------------------------------------------ | :---------: | :------------: |:-----------: | :-------------: |\n| [001][001-question] | [Two Sum][001-tips]                                          | [Easy][E]   | [✅][001-java] | [✅][001-js] | [✅][001-kotlin] |\n| [002][002-question] | [Add Two Numbers][002-tips]                                  | [Medium][M] | [✅][002-java] |              | [✅][002-kotlin] |\n| [003][003-question] | [Longest Substring Without Repeating Characters][003-tips]   | [Medium][M] | [✅][003-java] |              | [✅][003-kotlin] |\n| [004][004-question] | [Median of Two Sorted Arrays][004-tips]                      | [Hard][H]   | [✅][004-java] |              | [✅][004-kotlin] |\n| [005][005-question] | [Longest Palindromic Substring][005-tips]                    | [Medium][M] | [✅][005-java] |              |                  |\n| [006][006-question] | [ZigZag Conversion][006-tips]                                | [Medium][M] | [✅][006-java] |              |                  |\n| [007][007-question] | [Reverse Integer][007-tips]                                  | [Easy][E]   | [✅][007-java] | [✅][007-js] | [✅][007-kotlin] |\n| [008][008-question] | [String to Integer (atoi)][008-tips]                         | [Medium][M] | [✅][008-java] |              |                  |\n| [009][009-question] | [Palindrome Number][009-tips]                                | [Easy][E]   | [✅][009-java] | [✅][009-js] | [✅][009-kotlin] |\n| [010][010-question] | [Regular Expression Matching][010-tips]                      | [Hard][H]   | [✅][010-java] |              |                  |\n| [011][011-question] | [Container With Most Water][011-tips]                        | [Medium][M] | [✅][011-java] |              |                  |\n| [012][012-question] | [Integer to Roman][012-tips]                                 | [Medium][M] | [✅][012-java] |              |                  |\n| [013][013-question] | [Roman to Integer][013-tips]                                 | [Easy][E]   | [✅][013-java] | [✅][013-js] | [✅][013-kotlin] |\n| [014][014-question] | [Longest Common Prefix][014-tips]                            | [Easy][E]   | [✅][014-java] | [✅][014-js] | [✅][014-kotlin] |\n| [015][015-question] | [3Sum][015-tips]                                             | [Medium][M] | [✅][015-java] |              |                  |\n| [016][016-question] | [3Sum Closest][016-tips]                                     | [Medium][M] | [✅][016-java] |              |                  |\n| [017][017-question] | [Letter Combinations of a Phone Number][017-tips]            | [Medium][M] | [✅][017-java] |              |                  |\n| [018][018-question] | [4Sum][018-tips]                                             | [Medium][M] | [✅][018-java] |              |                  |\n| [019][019-question] | [Remove Nth Node From End of List][019-tips]                 | [Medium][M] | [✅][019-java] |              |                  |\n| [020][020-question] | [Valid Parentheses][020-tips]                                | [Easy][E]   | [✅][020-java] | [✅][020-js] | [✅][020-kotlin] |\n| [021][021-question] | [Merge Two Sorted Lists][021-tips]                           | [Easy][E]   | [✅][021-java] | [✅][021-js] | [✅][021-kotlin] |\n| [022][022-question] | [Generate Parentheses][022-tips]                             | [Medium][M] | [✅][022-java] |              |                  |\n| [023][023-question] | [Merge k Sorted Lists][023-tips]                             | [Hard][H]   | [✅][023-java] |              |                  |\n| [024][024-question] | [Swap Nodes in Pairs][024-tips]                              | [Medium][M] | [✅][024-java] |              |                  |\n| [025][025-question] | [Reverse Nodes in k-Group][025-tips]                         | [Hard][H]   | [✅][025-java] |              |                  |\n| [026][026-question] | [Remove Duplicates from Sorted Array][026-tips]              | [Easy][E]   | [✅][026-java] | [✅][026-js] | [✅][026-kotlin] |\n| [027][027-question] | [Remove Element][027-tips]                                   | [Easy][E]   | [✅][027-java] | [✅][027-js] | [✅][027-kotlin] |\n| [028][028-question] | [Implement strStr()][028-tips]                               | [Easy][E]   | [✅][028-java] | [✅][027-js] | [✅][028-kotlin] |\n| [029][029-question] | [Divide Two Integers][029-tips]                              | [Medium][M] | [✅][029-java] |              |                  |\n| [030][030-question] | [Substring with Concatenation of All Words][030-tips]        | [Hard][H]   | [✅][030-java] |              |                  |\n| [033][033-question] | [Search in Rotated Sorted Array][033-tips]                   | [Medium][M] | [✅][033-java] |              |                  |\n| [035][035-question] | [Search Insert Position][035-tips]                           | [Easy][E]   | [✅][035-java] | [✅][035-js] | [✅][035-kotlin] |\n| [038][038-question] | [Count and Say][038-tips]                                    | [Easy][E]   | [✅][038-java] | [✅][038-js] | [✅][038-kotlin] |\n| [043][043-question] | [Multiply Strings][043-tips]                                 | [Medium][M] | [✅][043-java] |              |                  |\n| [044][044-question] | [Wildcard Matching][044-tips]                                | [Hard][H]   | [✅][044-java] |              |                  |\n| [049][049-question] | [Group Anagrams][049-tips]                                   | [Medium][M] | [✅][049-java] |              |                  |\n| [050][050-question] | [Pow(x, n)][050-tips]                                        | [Medium][M] | [✅][050-java] |              |                  |\n| [053][053-question] | [Maximum Subarray][053-tips]                                 | [Easy][E]   | [✅][053-java] | [✅][053-js] | [✅][053-kotlin] |\n| [056][056-question] | [Merge Intervals][056-tips]                                  | [Medium][M] | [✅][056-java] |              |                  |\n| [057][057-question] | [Insert Interval][057-tips]                                  | [Hard][H]   | [✅][057-java] |              |                  |\n| [058][058-question] | [Length of Last Word][058-tips]                              | [Easy][E]   | [✅][058-java] | [✅][058-js] | [✅][058-kotlin] |\n| [066][066-question] | [Plus One][066-tips]                                         | [Easy][E]   | [✅][066-java] | [✅][066-js] | [✅][066-kotlin] |\n| [067][067-question] | [Add Binary][067-tips]                                       | [Easy][E]   | [✅][067-java] | [✅][067-js] | [✅][067-kotlin] |\n| [068][068-question] | [Text Justification][068-tips]                               | [Hard][H]   | [✅][068-java] |              |                  |\n| [069][069-question] | [Sqrt(x)][069-tips]                                          | [Easy][E]   | [✅][069-java] | [✅][069-js] | [✅][069-kotlin] |\n| [070][070-question] | [Climbing Stairs][070-tips]                                  | [Easy][E]   | [✅][070-java] | [✅][070-js] | [✅][070-kotlin] |\n| [083][083-question] | [Remove Duplicates from Sorted List][083-tips]               | [Easy][E]   | [✅][083-java] | [✅][083-js] | [✅][083-kotlin] |\n| [088][088-question] | [Merge Sorted Array][088-tips]                               | [Easy][E]   | [✅][088-java] | [✅][088-js] | [✅][088-kotlin] |\n| [100][100-question] | [Same Tree][100-tips]                                        | [Easy][E]   | [✅][100-java] | [✅][100-js] | [✅][100-kotlin] |\n| [101][101-question] | [Symmetric Tree][101-tips]                                   | [Easy][E]   | [✅][101-java] | [✅][101-js] | [✅][101-kotlin] |\n| [104][104-question] | [Maximum Depth of Binary Tree][104-tips]                     | [Easy][E]   | [✅][104-java] | [✅][104-js] | [✅][104-kotlin] |\n| [107][107-question] | [Binary Tree Level Order Traversal II][107-tips]             | [Easy][E]   | [✅][107-java] | [✅][107-js] | [✅][107-kotlin] |\n| [108][108-question] | [Convert Sorted Array to Binary Search Tree][108-tips]       | [Easy][E]   | [✅][108-java] | [✅][108-js] | [✅][108-kotlin] |\n| [110][110-question] | [Balanced Binary Tree][110-tips]                             | [Easy][E]   | [✅][110-java] | [✅][110-js] | [✅][110-kotlin] |\n| [111][111-question] | [Minimum Depth of Binary Tree][111-tips]                     | [Easy][E]   | [✅][111-java] | [✅][111-js] | [✅][111-kotlin] |\n| [112][112-question] | [Path Sum][112-tips]                                         | [Easy][E]   | [✅][112-java] | [✅][112-js] | [✅][112-kotlin] |\n| [118][118-question] | [Pascal's Triangle][118-tips]                                | [Easy][E]   | [✅][118-java] | [✅][118-js] | [✅][118-kotlin] |\n| [119][119-question] | [Pascal's Triangle II][119-tips]                             | [Easy][E]   | [✅][119-java] | [✅][119-js] | [✅][119-kotlin] |\n| [121][121-question] | [Best Time to Buy and Sell Stock][121-tips]                  | [Easy][E]   | [✅][121-java] | [✅][121-js] | [✅][121-kotlin] |\n| [122][122-question] | [Best Time to Buy and Sell Stock II][122-tips]               | [Easy][E]   | [✅][122-java] | [✅][122-js] | [✅][122-kotlin] |\n| [125][125-question] | [Valid Palindrome][125-tips]                                 | [Easy][E]   |                | [✅][125-js] | [✅][125-kotlin] |\n| [136][136-question] | [Single Number][136-tips]                                    | [Easy][E]   |                | [✅][136-js]  | [✅][136-kotlin] |\n| [141][141-question] | [Linked List Cycle][141-tips]                                | [Easy][E]   | [✅][141-java] |              |        -         |\n| [155][155-question] | [Min Stack][155-tips]                                        | [Easy][E]   | [✅][155-java] | [✅][155-js] | [✅][155-kotlin] |\n| [160][160-question] | [Intersection of Two Linked Lists][160-tips]                 | [Easy][E]   | [✅][160-java] |              |        -         |\n| [167][167-question] | [Two Sum II - Input array is sorted][167-tips]               | [Easy][E]   |                | [✅][167-js] |        -         |\n| [168][168-question] | [Excel Sheet Column Title][168-tips]                         | [Easy][E]   |                | [✅][168-js] |        -         |\n| [169][169-question] | [Majority Element][169-tips]                                 | [Easy][E]   |                | [✅][169-js] |        -         |\n| [171][171-question] | [excel-sheet-column-number][171-tips]                        | [Easy][E]   |                | [✅][171-js] |        -         |\n| [226][226-question] | [Invert Binary Tree][226-tips]                               | [Easy][E]   | [✅][226-java] | [✅][226-js] | [✅][226-kotlin] |\n| [504][504-question] | [Base 7][504-tips]                                           | [Easy][E]   |                |              | [✅][504-kotlin] |\n| [543][543-question] | [Diameter of Binary Tree][543-tips]                          | [Easy][E]   | [✅][543-java] |              | [✅][543-kotlin] |\n| [554][554-question] | [Brick Wall][554-tips]                                       | [Medium][M] | [✅][554-java] |              |                  |\n| [561][561-question] | [Array Partition I][561-tips]                                | [Easy][E]   | [✅][561-java] | [✅][561-js] |                  |\n| [643][643-question] | [Maximum Average Subarray I][643-tips]                       | [Easy][E]   | [✅][643-java] | [✅][643-js] |                  |\n| [645][645-question] | [Set Mismatch][645-tips]                                     | [Easy][E]   | [✅][645-java] | [✅][645-js] |                  |\n| [653][653-question] | [Two Sum IV - Input is a BST][653-tips]                      | [Easy][E]   | [✅][653-java] | [✅][653-js] |                  |\n| [657][657-question] | [Judge Route Circle][657-tips]                               | [Easy][E]   | [✅][657-java] | [✅][657-js] |                  |\n| [661][661-question] | [Image Smoother][661-tips]                                   | [Easy][E]   | [✅][661-java] | [✅][661-js] |                  |\n| [665][665-question] | [Non-decreasing Array][665-tips]                             | [Easy][E]   | [✅][665-java] | [✅][665-js] |                  |\n| [669][669-question] | [Trim a Binary Search Tree][669-tips]                        | [Easy][E]   | [✅][669-java] | [✅][669-js] |                  |\n| [671][671-question] | [Second Minimum Node In a Binary Tree][671-tips]             | [Easy][E]   | [✅][671-java] | [✅][671-js] |                  |\n| [674][674-question] | [Longest Continuous Increasing Subsequence][674-tips]        | [Easy][E]   | [✅][674-java] | [✅][674-js] |                  |\n| [680][680-question] | [Valid Palindrome II][680-tips]                              | [Easy][E]   | [✅][680-java] | [✅][680-js] |                  |\n| [682][682-question] | [Baseball Game][682-tips]                                    | [Easy][E]   | [✅][682-java] | [✅][682-js] |                  |\n| [686][686-question] | [Repeated String Match][686-tips]                            | [Easy][E]   | [✅][686-java] | [✅][686-js] |                  |\n| [687][687-question] | [Longest Univalue Path][687-tips]                            | [Easy][E]   | [✅][687-java] | [✅][687-js] |                  |\n| [693][693-question] | [Binary Number with Alternating Bits][693-tips]              | [Easy][E]   | [✅][693-java] | [✅][693-js] |                  |\n| [695][695-question] | [Max Area of Island][695-tips]                               | [Easy][E]   | [✅][695-java] | [✅][695-js] |                  |\n| [696][696-question] | [Count Binary Substrings][696-tips]                          | [Easy][E]   | [✅][696-java] | [✅][696-js] |                  |\n| [697][697-question] | [Degree of an Array][697-tips]                               | [Easy][E]   | [✅][697-java] | [✅][697-js] |                  |\n| [717][717-question] | [1-bit and 2-bit Characters][717-tips]                       | [Easy][E]   | [✅][717-java] | [✅][717-js] |                  |\n| [720][720-question] | [Longest Word in Dictionary][720-tips]                       | [Easy][E]   | [✅][720-java] | [✅][720-js] |                  |\n| [724][724-question] | [Find Pivot Index][724-tips]                                 | [Easy][E]   | [✅][724-java] | [✅][724-js] |                  |\n| [728][728-question] | [Self Dividing Numbers][728-tips]                            | [Easy][E]   | [✅][728-java] | [✅][728-js] |                  |\n| [733][733-question] | [Flood Fill][733-tips]                                       | [Easy][E]   | [✅][733-java] | [✅][733-js] |                  |\n| [744][744-question] | [Find Smallest Letter Greater Than Target][744-tips]         | [Easy][E]   | [✅][744-java] | [✅][744-js] |                  |\n| [746][746-question] | [Min Cost Climbing Stairs][746-tips]                         | [Easy][E]   | [✅][746-java] | [✅][746-js] |                  |\n| [747][747-question] | [Largest Number At Least Twice of Others][747-tips]          | [Easy][E]   | [✅][747-java] | [✅][747-js] |                  |\n| [762][762-question] | [Prime Number of Set Bits in Binary Representation][762-tips]| [Easy][E]   | [✅][762-java] | [✅][762-js] |                  |\n| [766][766-question] | [Toeplitz Matrix][766-tips]                                  | [Easy][E]   | [✅][766-java] | [✅][766-js] |                  |\n| [771][771-question] | [Jewels and Stones][771-tips]                                | [Easy][E]   | [✅][771-java] | [✅][771-js] | [✅][771-kotlin] |\n| [783][783-question] | [Minimum Distance Between BST Nodes][783-tips]               | [Easy][E]   | [✅][783-java] | [✅][783-js] |                  |\n| [784][784-question] | [Letter Case Permutation][784-tips]                          | [Easy][E]   |                | [✅][784-js] |                  |\n| [788][788-question] | [Rotated Digits][788-tips]                                   | [Easy][E]   |                | [✅][788-js] |                  |\n| [796][796-question] | [Rotate String][796-tips]                                    | [Easy][E]   |                | [✅][796-js] |                  |\n| [804][804-question] | [Unique Morse Code Words][804-tips]                          | [Easy][E]   | [✅][804-java] |              |                  |\n| [806][806-question] | [Number of Lines To Write String][806-tips]                  | [Easy][E]   |                | [✅][806-js] |                  |\n\n## 库维护须知\n\n请大家遵守规范，勤加维护。对规范有异议可以提出意见，经过讨论，并落地合理的规范。\n\n注: 为方便阐述规范，以下内容以“使用**Java**语言解答**第001题**-**Two Sum**”为例进行说明。\n\n### 本仓库的起源\n为避免误解，以下称[RichCodersAndMe/LeetCode-Solution][lcs]为**本仓库**, 被介绍的仓库称为**此仓库**。\n#### 来源1: [@Blankj][blankj]的[awsome-java-leetcode][ajl]\n**此仓库**由[@Blankj][blankj]于2017年4月18日创建, 不定期更新优质**Java**代码和题解，颇受好评，至今已有star数**3521**颗(star数量以仓库原址为准)。截止**本仓库**建立为止, **此仓库**已累计拥有**63**题已AC的Java代码。\n\n#### 来源2: [@Wang-YS][wys]的[leetcode][lc]\n**此仓库**由[@Wang-YS][wys]于2018年2月28日创建，不定期更新优质**JavaScript**代码，属于个人练习项目。截止**本仓库**建立为止, **此仓库**已累计拥有**33**题已AC的JavaScript代码。\n\n#### 来源3 [@CodeAntStudio][cas]的[LeetCode-Solution][old-lcs]\n**此仓库**由[@Mukyu][Mukyu]、[@Taryn][Taryn]、[@WangXin][wangxin]于2018年3月31日创建，由[@Mukyu][Mukyu]提供**Java**题解，[@Taryn][Taryn]提供**JavaScript**题解，[@WangXin][wangxin]提供**kotlin**题解，属于刚刚萌生想法的而创建的新仓库。截止**本仓库**建立为止, **此仓库**已累计拥有**5**题已AC的Java代码、**2**题已AC的JavaScript代码、**3**题已AC的kotlin代码。\n\n\n### 文档编写规范 \n 举例说明:  \n 当提交首页表格未收录的题目时:   \n  - 1 需提交对应解题代码-\u003e`./src/_001/Solution.java`\n  - 2 对应的题目题解markdown文件(此文件填写规范参看[题解模板][template])-\u003e`./tips/001/README.md`\n  - 3 在首页`README.md`对应的位置添加记录   \n     - 3.1 根据题目难度(Easy、Medium、Hard),在对应的表格内的对应位置(根据题号排序)添加行\n     - 3.2 添加原题地址（[001-question]: https://leetcode.com/problems/two-sum）\n     - 3.3 添加题解地址 ([001-tips]: ./tips/001/README.md)  \n     - 3.4 添加原题对应的**Tags**（就是在原题网页偏右下位置的`Related Topics`）\n     - 3.5 添加代码地址 ([001-java]: ./src/_001/Solution.java)  \n       (注: 同名的kotlin与Java类在同一个目录下会冲突,故kotlin放在更深一层的`kotlin`文件夹中:`./src/_001/kotlin/Solution.kt`)\n\n 总而言之三步走: **代码**、**题解**、**首页README.md**\n\n### commit信息提交规范\n\u003e feat：提交新的AC代码  \n\u003e fix：修补bug  \n\u003e docs：文档修改  \n\u003e style： 格式（不影响代码运行的变动）  \n\u003e refactor：重构（即不是新增功能，也不是修改bug的代码变动）  \n\u003e test：增加测试  \n\u003e chore：构建过程或辅助工具的变动  \n\n基本可以按照上述情况对号入座, 还是不明白的参看*历史提交记录*(`git log`)。\n\ncommit前先pull, 尽量避免产生不必要的git分叉.  \n\ncommit信息模板: ``feat: add the solution of `Two Sum`(001) with Java``\n\n### 添加新语言代码\n目前已使用的代码有: `Java`、`JavaScript`、`kotlin`\n添加新的语言的解题代码, 请按**字母序**排列，在**对应列**添加解题代码且附链接，文档编写相关细节参看[commit信息提交规范](#commit信息提交规范)。\n\n\n### 其他问题\n#### 1 同题的同种语言的代码如何处理？\n建议保留一份即可(优先保留高效代码), 如果有更好/值得一说的思路,可以在题解中体现。\n如果非要保留自己的代码, 请遵守以下规则:\n  - 首页README.md优先使用最优解的代码链接，认为最优解可以进一步优化或有更好的解法时，可通过提Issue的方式进行讨论和决定。\n  - 如果同语言代码思路不同可以在**题解文档内**阐述思路,若思路相同，则不再赘述。\n  - 文件名则改为: `Solution1.java`、`Solution2.java`、`Solution3.java`,以此类推。\n\n#### 2 未完善的题解\n目前存在大量未完善的题解, 原因是[@Wang-YS][wys]大佬的原仓库没有写题解，只有已AC的js代码。\n大概分散在561~804题。那个啥，大家努力完善吧。\n\n\n## 贡献者名单\n\n排名不分先后\n- 感谢[@Mukyu](https://github.com/Mukyu), 提供**Java**题解。\n- 感谢[@Taryn](https://github.com/taryn2016), 提供**JavaScript**题解。\n- 感谢[@Wang-YS](https://github.com/Wang-YS), 提供**JavaScrip**代码。\n- 感谢[@Blankj](https://github.com/Blankj), 提供**Java**题解、**镇楼诗**及**文档编写规范**。\n- 感谢[@WangXin](https://github.com/relish-wang), 提供**kotlin**代码、**文档整理**及**库维护规范**。\n\n[companies]: ./Companies.md\n\n[blankj]: https://github.com/Blankj\n[ajl]: https://github.com/Blankj/awesome-java-leetcode\n[wys]: https://github.com/Wang-YS\n[lc]: https://github.com/Wang-YS/leetcode\n[lcs]: https://github.com/RichCodersAndMe/LeetCode-Solution\n[old-lcs]: https://github.com/CodeAntStudio/LeetCode-Solution\n[wangxin]: https://github.com/relish-wang\n[Mukyu]: https://github.com/Mukyu\n[Taryn]: https://github.com/Taryn2016\n[cas]: https://github.com/CodeAntStudio\n[template]: ./tips/Template.md\n\n[E]: https://leetcode.com/problemset/all/?difficulty=Easy\n[M]: https://leetcode.com/problemset/all/?difficulty=Medium\n[H]: https://leetcode.com/problemset/all/?difficulty=Hard\n\n[001-question]: https://leetcode.com/problems/two-sum/description/\n[002-question]: https://leetcode.com/problems/add-two-numbers/description/\n[003-question]: https://leetcode.com/problems/longest-substring-without-repeating-characters/\n[004-question]: https://leetcode.com/problems/median-of-two-sorted-arrays/\n[005-question]: https://leetcode.com/problems/longest-palindromic-substring/\n[006-question]: https://leetcode.com/problems/zigzag-conversion/\n[007-question]: https://leetcode.com/problems/reverse-integer/\n[008-question]: https://leetcode.com/problems/string-to-integer-atoi/description/\n[009-question]: https://leetcode.com/problems/palindrome-number/\n[010-question]: https://leetcode.com/problems/regular-expression-matching/\n[011-question]: https://leetcode.com/problems/container-with-most-water/\n[012-question]: https://leetcode.com/problems/integer-to-roman/\n[013-question]: https://leetcode.com/problems/roman-to-integer/\n[014-question]: https://leetcode.com/problems/longest-common-prefix/\n[015-question]: https://leetcode.com/problems/3sum/description/\n[016-question]: https://leetcode.com/problems/3sum-closest/\n[017-question]: https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/\n[018-question]: https://leetcode.com/problems/4sum/\n[019-question]: https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/\n[020-question]: https://leetcode.com/problems/valid-parentheses/description/\n[021-question]: https://leetcode.com/problems/merge-two-sorted-lists/\n[022-question]: https://leetcode.com/problems/generate-parentheses/\n[023-question]: https://leetcode.com/problems/merge-k-sorted-lists/\n[024-question]: https://leetcode.com/problems/swap-nodes-in-pairs/\n[025-question]: https://leetcode.com/problems/reverse-nodes-in-k-group/\n[026-question]: https://leetcode.com/problems/remove-duplicates-from-sorted-array/\n[027-question]: https://leetcode.com/problems/remove-element/\n[028-question]: https://leetcode.com/problems/implement-strstr/\n[029-question]: https://leetcode.com/problems/divide-two-integers/description/\n[030-question]: https://leetcode.com/problems/substring-with-concatenation-of-all-words/\n[033-question]: https://leetcode.com/problems/search-in-rotated-sorted-array/description/\n[035-question]: https://leetcode.com/problems/search-insert-position/description/\n[038-question]: https://leetcode.com/problems/count-and-say/\n[043-question]: https://leetcode.com/problems/multiply-strings/\n[044-question]: https://leetcode.com/problems/wildcard-matching/\n[049-question]: https://leetcode.com/problems/group-anagrams/\n[050-question]: https://leetcode.com/problems/powx-n/\n[053-question]: https://leetcode.com/problems/maximum-subarray/\n[056-question]: https://leetcode.com/problems/merge-intervals/\n[057-question]: https://leetcode.com/problems/insert-interval/\n[058-question]: https://leetcode.com/problems/length-of-last-word/\n[066-question]: https://leetcode.com/problems/plus-one/\n[067-question]: https://leetcode.com/problems/add-binary/\n[068-question]: https://leetcode.com/problems/text-justification/\n[069-question]: https://leetcode.com/problems/sqrtx/description/\n[070-question]: https://leetcode.com/problems/climbing-stairs/\n[083-question]: https://leetcode.com/problems/remove-duplicates-from-sorted-list/\n[088-question]: https://leetcode.com/problems/merge-sorted-array/\n[100-question]: https://leetcode.com/problems/same-tree/\n[101-question]: https://leetcode.com/problems/symmetric-tree/\n[104-question]: https://leetcode.com/problems/maximum-depth-of-binary-tree/\n[107-question]: https://leetcode.com/problems/binary-tree-level-order-traversal-ii/\n[108-question]: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/\n[110-question]: https://leetcode.com/problems/balanced-binary-tree/\n[111-question]: https://leetcode.com/problems/minimum-depth-of-binary-tree/description/\n[112-question]: https://leetcode.com/problems/path-sum/description/\n[118-question]: https://leetcode.com/problems/pascals-triangle/\n[119-question]: https://leetcode.com/problems/pascals-triangle-ii/\n[121-question]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/\n[122-question]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/\n[125-question]: https://leetcode.com/problems/valid-palindrome/\n[136-question]: https://leetcode.com/problems/single-number/\n[141-question]: https://leetcode.com/problems/linked-list-cycle/\n[155-question]: https://leetcode.com/problems/min-stack/\n[160-question]: https://leetcode.com/problems/intersection-of-two-linked-lists/\n[167-question]: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/\n[168-question]: https://leetcode.com/problems/excel-sheet-column-title/\n[169-question]: https://leetcode.com/problems/majority-element/\n[171-question]: https://leetcode.com/problems/excel-sheet-column-number/\n[226-question]: https://leetcode.com/problems/invert-binary-tree/\n[504-question]: https://leetcode.com/problems/base-7/description/\n[543-question]: https://leetcode.com/problems/diameter-of-binary-tree/\n[554-question]: https://leetcode.com/problems/brick-wall/description/\n[561-question]: https://leetcode.com/problems/array-partition-i/\n[643-question]: https://leetcode.com/problems/maximum-average-subarray-i/\n[645-question]: https://leetcode.com/problems/set-mismatch/\n[653-question]: https://leetcode.com/problems/two-sum-iv-input-is-a-bst/\n[657-question]: https://leetcode.com/problems/judge-route-circle/\n[661-question]: https://leetcode.com/problems/image-smoother/\n[665-question]: https://leetcode.com/problems/non-decreasing-array/\n[669-question]: https://leetcode.com/problems/trim-a-binary-search-tree/\n[671-question]: https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/\n[674-question]: https://leetcode.com/problems/longest-continuous-increasing-subsequence/\n[680-question]: https://leetcode.com/problems/valid-palindrome-ii/\n[682-question]: https://leetcode.com/problems/baseball-game/\n[686-question]: https://leetcode.com/problems/repeated-string-match/\n[687-question]: https://leetcode.com/problems/longest-univalue-path/\n[693-question]: https://leetcode.com/problems/binary-number-with-alternating-bits/\n[695-question]: https://leetcode.com/problems/max-area-of-island/\n[696-question]: https://leetcode.com/problems/count-binary-substrings/\n[697-question]: https://leetcode.com/problems/degree-of-an-array/\n[717-question]: https://leetcode.com/problems/1-bit-and-2-bit-characters/\n[720-question]: https://leetcode.com/problems/longest-word-in-dictionary/\n[728-question]: https://leetcode.com/problems/self-dividing-numbers/description/\n[724-question]: https://leetcode.com/problems/find-pivot-index/\n[733-question]: https://leetcode.com/problems/flood-fill/\n[744-question]: https://leetcode.com/problems/find-smallest-letter-greater-than-target/\n[746-question]: https://leetcode.com/problems/min-cost-climbing-stairs/\n[747-question]: https://leetcode.com/problems/largest-number-at-least-twice-of-others/\n[762-question]: https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/\n[766-question]: https://leetcode.com/problems/toeplitz-matrix/description/\n[771-question]: https://leetcode.com/problems/jewels-and-stones/description/\n[783-question]: https://leetcode.com/problems/minimum-distance-between-bst-nodes/\n[784-question]: https://leetcode.com/problems/letter-case-permutation/description/\n[788-question]: https://leetcode.com/problems/rotated-digits/\n[796-question]: https://leetcode.com/problems/rotate-string/\n[804-question]: https://leetcode.com/problems/unique-morse-code-words/description/\n[806-question]: https://leetcode.com/problems/number-of-lines-to-write-string/\n\n[001-tips]: ./tips/001/README.md\n[002-tips]: ./tips/002/README.md\n[003-tips]: ./tips/003/README.md\n[004-tips]: ./tips/004/README.md\n[005-tips]: ./tips/005/README.md\n[006-tips]: ./tips/006/README.md\n[007-tips]: ./tips/007/README.md\n[008-tips]: ./tips/008/README.md\n[009-tips]: ./tips/009/README.md\n[010-tips]: ./tips/010/README.md\n[011-tips]: ./tips/011/README.md\n[012-tips]: ./tips/012/README.md\n[013-tips]: ./tips/013/README.md\n[014-tips]: ./tips/014/README.md\n[015-tips]: ./tips/015/README.md\n[016-tips]: ./tips/016/README.md\n[017-tips]: ./tips/017/README.md\n[018-tips]: ./tips/018/README.md\n[019-tips]: ./tips/019/README.md\n[020-tips]: ./tips/020/README.md\n[021-tips]: ./tips/021/README.md\n[022-tips]: ./tips/022/README.md\n[023-tips]: ./tips/023/README.md\n[024-tips]: ./tips/024/README.md\n[025-tips]: ./tips/025/README.md\n[026-tips]: ./tips/026/README.md\n[027-tips]: ./tips/027/README.md\n[028-tips]: ./tips/028/README.md\n[029-tips]: ./tips/029/README.md\n[030-tips]: ./tips/030/README.md\n[033-tips]: ./tips/033/README.md\n[035-tips]: ./tips/035/README.md\n[038-tips]: ./tips/038/README.md\n[043-tips]: ./tips/043/README.md\n[044-tips]: ./tips/044/README.md\n[049-tips]: ./tips/049/README.md\n[050-tips]: ./tips/050/README.md\n[053-tips]: ./tips/053/README.md\n[056-tips]: ./tips/056/README.md\n[057-tips]: ./tips/057/README.md\n[058-tips]: ./tips/058/README.md\n[066-tips]: ./tips/066/README.md\n[067-tips]: ./tips/067/README.md\n[068-tips]: ./tips/068/README.md\n[069-tips]: ./tips/069/README.md\n[070-tips]: ./tips/070/README.md\n[083-tips]: ./tips/083/README.md\n[088-tips]: ./tips/088/README.md\n[100-tips]: ./tips/100/README.md\n[101-tips]: ./tips/101/README.md\n[104-tips]: ./tips/104/README.md\n[107-tips]: ./tips/107/README.md\n[108-tips]: ./tips/108/README.md\n[110-tips]: ./tips/110/README.md\n[111-tips]: ./tips/111/README.md\n[112-tips]: ./tips/112/README.md\n[118-tips]: ./tips/118/README.md\n[119-tips]: ./tips/119/README.md\n[121-tips]: ./tips/121/README.md\n[122-tips]: ./tips/122/README.md\n[125-tips]: ./tips/125/README.md\n[136-tips]: ./tips/136/README.md\n[141-tips]: ./tips/141/README.md\n[155-tips]: ./tips/155/README.md\n[160-tips]: ./tips/160/README.md\n[167-tips]: ./tips/167/README.md\n[168-tips]: ./tips/168/README.md\n[169-tips]: ./tips/169/README.md\n[171-tips]: ./tips/171/README.md\n[226-tips]: ./tips/226/README.md\n[504-tips]: ./tips/504/README.md\n[543-tips]: ./tips/543/README.md\n[554-tips]: ./tips/554/README.md\n[561-tips]: ./tips/561/README.md\n[643-tips]: ./tips/643/README.md\n[645-tips]: ./tips/645/README.md\n[653-tips]: ./tips/653/README.md\n[657-tips]: ./tips/657/README.md\n[661-tips]: ./tips/661/README.md\n[665-tips]: ./tips/665/README.md\n[669-tips]: ./tips/669/README.md\n[671-tips]: ./tips/671/README.md\n[674-tips]: ./tips/674/README.md\n[680-tips]: ./tips/680/README.md\n[682-tips]: ./tips/682/README.md\n[686-tips]: ./tips/686/README.md\n[687-tips]: ./tips/687/README.md\n[693-tips]: ./tips/693/README.md\n[695-tips]: ./tips/695/README.md\n[696-tips]: ./tips/696/README.md\n[697-tips]: ./tips/697/README.md\n[717-tips]: ./tips/717/README.md\n[720-tips]: ./tips/720/README.md\n[724-tips]: ./tips/724/README.md\n[728-tips]: ./tips/728/README.md\n[733-tips]: ./tips/733/README.md\n[744-tips]: ./tips/744/README.md\n[746-tips]: ./tips/746/README.md\n[747-tips]: ./tips/747/README.md\n[762-tips]: ./tips/762/README.md\n[766-tips]: ./tips/766/README.md\n[771-tips]: ./tips/771/README.md\n[783-tips]: ./tips/783/README.md\n[784-tips]: ./tips/784/README.md\n[788-tips]: ./tips/788/README.md\n[796-tips]: ./tips/796/README.md\n[804-tips]: ./tips/804/README.md\n[806-tips]: ./tips/806/README.md\n\n[001-js]: ./src/_001/Solution.js\n[007-js]: ./src/_007/Solution.js\n[009-js]: ./src/_009/Solution.js\n[013-js]: ./src/_013/Solution.js\n[014-js]: ./src/_014/Solution.js\n[020-js]: ./src/_020/Solution.js\n[021-js]: ./src/_021/Solution.js\n[026-js]: ./src/_026/Solution.js\n[027-js]: ./src/_027/Solution.js\n[028-js]: ./src/_028/Solution.js\n[035-js]: ./src/_035/Solution.js\n[038-js]: ./src/_038/Solution.js\n[053-js]: ./src/_053/Solution.js\n[058-js]: ./src/_058/Solution.js\n[066-js]: ./src/_066/Solution.js\n[067-js]: ./src/_067/Solution.js\n[069-js]: ./src/_069/Solution.js\n[070-js]: ./src/_070/Solution.js\n[083-js]: ./src/_083/Solution.js\n[088-js]: ./src/_088/Solution.js\n[100-js]: ./src/_100/Solution.js\n[101-js]: ./src/_101/Solution.js\n[104-js]: ./src/_104/Solution.js\n[107-js]: ./src/_107/Solution.js\n[108-js]: ./src/_108/Solution.js\n[110-js]: ./src/_110/Solution.js\n[111-js]: ./src/_111/Solution.js\n[112-js]: ./src/_112/Solution.js\n[118-js]: ./src/_118/Solution.js\n[119-js]: ./src/_119/Solution.js\n[121-js]: ./src/_121/Solution.js\n[122-js]: ./src/_122/Solution.js\n[125-js]: ./src/_125/Solution.js\n[136-js]: ./src/_136/Solution.js\n[155-js]: ./src/_155/Solution.js\n[167-js]: ./src/_167/Solution.js\n[168-js]: ./src/_168/Solution.js\n[169-js]: ./src/_169/Solution.js\n[171-js]: ./src/_171/Solution.js\n[226-js]: ./src/_226/Solution.js\n[561-js]: ./src/_561/Solution.js\n[643-js]: ./src/_643/Solution.js\n[645-js]: ./src/_645/Solution.js\n[653-js]: ./src/_653/Solution.js\n[657-js]: ./src/_657/Solution.js\n[661-js]: ./src/_661/Solution.js\n[665-js]: ./src/_665/Solution.js\n[669-js]: ./src/_669/Solution.js\n[671-js]: ./src/_671/Solution.js\n[674-js]: ./src/_674/Solution.js\n[680-js]: ./src/_680/Solution.js\n[682-js]: ./src/_682/Solution.js\n[686-js]: ./src/_686/Solution.js\n[687-js]: ./src/_687/Solution.js\n[693-js]: ./src/_693/Solution.js\n[695-js]: ./src/_695/Solution.js\n[696-js]: ./src/_696/Solution.js\n[697-js]: ./src/_697/Solution.js\n[717-js]: ./src/_717/Solution.js\n[720-js]: ./src/_720/Solution.js\n[724-js]: ./src/_724/Solution.js\n[728-js]: ./src/_728/Solution.js\n[733-js]: ./src/_733/Solution.js\n[744-js]: ./src/_744/Solution.js\n[746-js]: ./src/_746/Solution.js\n[747-js]: ./src/_747/Solution.js\n[762-js]: ./src/_762/Solution.js\n[766-js]: ./src/_766/Solution.js\n[771-js]: ./src/_771/Solution.js\n[783-js]: ./src/_783/Solution.js\n[784-js]: ./src/_784/Solution.js\n[788-js]: ./src/_788/Solution.js\n[796-js]: ./src/_796/Solution.js\n[806-js]: ./src/_806/Solution.js\n\n[001-java]: ./src/_001/Solution.java\n[002-java]: ./src/_002/Solution.java\n[003-java]: ./src/_003/Solution.java\n[004-java]: ./src/_004/Solution.java\n[005-java]: ./src/_005/Solution.java\n[006-java]: ./src/_006/Solution.java\n[007-java]: ./src/_007/Solution.java\n[008-java]: ./src/_008/Solution.java\n[009-java]: ./src/_009/Solution.java\n[010-java]: ./src/_010/Solution.java\n[011-java]: ./src/_011/Solution.java\n[012-java]: ./src/_012/Solution.java\n[013-java]: ./src/_013/Solution.java\n[014-java]: ./src/_014/Solution.java\n[015-java]: ./src/_015/Solution.java\n[016-java]: ./src/_016/Solution.java\n[017-java]: ./src/_017/Solution.java\n[018-java]: ./src/_018/Solution.java\n[019-java]: ./src/_019/Solution.java\n[020-java]: ./src/_020/Solution.java\n[021-java]: ./src/_021/Solution.java\n[022-java]: ./src/_022/Solution.java\n[023-java]: ./src/_023/Solution.java\n[024-java]: ./src/_024/Solution.java\n[025-java]: ./src/_025/Solution.java\n[026-java]: ./src/_026/Solution.java\n[027-java]: ./src/_027/Solution.java\n[028-java]: ./src/_028/Solution.java\n[029-java]: ./src/_029/Solution.java\n[030-java]: ./src/_030/Solution.java\n[033-java]: ./src/_033/Solution.java\n[035-java]: ./src/_035/Solution.java\n[038-java]: ./src/_038/Solution.java\n[043-java]: ./src/_043/Solution.java\n[044-java]: ./src/_044/Solution.java\n[049-java]: ./src/_049/Solution.java\n[050-java]: ./src/_050/Solution.java\n[053-java]: ./src/_053/Solution.java\n[056-java]: ./src/_056/Solution.java\n[057-java]: ./src/_057/Solution.java\n[058-java]: ./src/_058/Solution.java\n[066-java]: ./src/_066/Solution.java\n[067-java]: ./src/_067/Solution.java\n[068-java]: ./src/_068/Solution.java\n[069-java]: ./src/_069/Solution.java\n[070-java]: ./src/_070/Solution.java\n[083-java]: ./src/_083/Solution.java\n[088-java]: ./src/_088/Solution.java\n[100-java]: ./src/_100/Solution.java\n[101-java]: ./src/_101/Solution.java\n[104-java]: ./src/_104/Solution.java\n[107-java]: ./src/_107/Solution.java\n[108-java]: ./src/_108/Solution.java\n[110-java]: ./src/_110/Solution.java\n[111-java]: ./src/_111/Solution.java\n[112-java]: ./src/_112/Solution.java\n[118-java]: ./src/_118/Solution.java\n[119-java]: ./src/_119/Solution.java\n[121-java]: ./src/_121/Solution.java\n[122-java]: ./src/_122/Solution.java\n[141-java]: ./src/_141/Solution.java\n[155-java]: ./src/_155/MinStack.java\n[160-java]: ./src/_160/Solution.java\n[226-java]: ./src/_226/Solution.java\n[543-java]: ./src/_543/Solution.java\n[554-java]: ./src/_554/Solution.java\n[561-java]: ./src/_561/Solution.java\n[643-java]: ./src/_643/Solution.java\n[645-java]: ./src/_645/Solution.java\n[653-java]: ./src/_653/Solution.java\n[657-java]: ./src/_657/Solution.java\n[661-java]: ./src/_661/Solution.java\n[665-java]: ./src/_665/Solution.java\n[669-java]: ./src/_669/Solution.java\n[671-java]: ./src/_671/Solution.java\n[674-java]: ./src/_674/Solution.java\n[680-java]: ./src/_680/Solution.java\n[686-java]: ./src/_686/Solution.java\n[687-java]: ./src/_687/Solution.java\n[682-java]: ./src/_682/Solution.java\n[693-java]: ./src/_693/Solution.java\n[695-java]: ./src/_695/Solution.java\n[696-java]: ./src/_696/Solution.java\n[697-java]: ./src/_697/Solution.java\n[717-java]: ./src/_717/Solution.java\n[720-java]: ./src/_720/Solution.java\n[724-java]: ./src/_724/Solution.java\n[728-java]: ./src/_728/Solution.java\n[733-java]: ./src/_733/Solution.java\n[744-java]: ./src/_744/Solution.java\n[746-java]: ./src/_746/Solution.java\n[747-java]: ./src/_747/Solution.java\n[762-java]: ./src/_762/Solution.java\n[766-java]: ./src/_766/Solution.java\n[771-java]: ./src/_771/Solution.java\n[783-java]: ./src/_783/Solution.java\n[804-java]: ./src/_804/Solution.java\n\n[001-kotlin]: ./src/_001/kotlin/Solution.kt\n[002-kotlin]: ./src/_002/kotlin/Solution.kt\n[003-kotlin]: ./src/_003/kotlin/Solution.kt\n[004-kotlin]: ./src/_004/kotlin/Solution.kt\n[007-kotlin]: ./src/_007/kotlin/Solution.kt\n[009-kotlin]: ./src/_009/kotlin/Solution.kt\n[013-kotlin]: ./src/_013/kotlin/Solution.kt\n[014-kotlin]: ./src/_014/kotlin/Solution.kt\n[020-kotlin]: ./src/_020/kotlin/Solution.kt\n[021-kotlin]: ./src/_021/kotlin/Solution.kt\n[026-kotlin]: ./src/_026/kotlin/Solution.kt\n[027-kotlin]: ./src/_027/kotlin/Solution.kt\n[028-kotlin]: ./src/_028/kotlin/Solution.kt\n[035-kotlin]: ./src/_035/kotlin/Solution.kt\n[038-kotlin]: ./src/_038/kotlin/Solution.kt\n[053-kotlin]: ./src/_053/kotlin/Solution.kt\n[058-kotlin]: ./src/_058/kotlin/Solution.kt\n[066-kotlin]: ./src/_066/kotlin/Solution.kt\n[067-kotlin]: ./src/_067/kotlin/Solution.kt\n[069-kotlin]: ./src/_069/kotlin/Solution.kt\n[070-kotlin]: ./src/_070/kotlin/Solution.kt\n[083-kotlin]: ./src/_083/kotlin/Solution.kt\n[088-kotlin]: ./src/_088/kotlin/Solution.kt\n[100-kotlin]: ./src/_100/kotlin/Solution.kt\n[101-kotlin]: ./src/_101/kotlin/Solution.kt\n[104-kotlin]: ./src/_104/kotlin/Solution.kt\n[107-kotlin]: ./src/_107/kotlin/Solution.kt\n[108-kotlin]: ./src/_108/kotlin/Solution.kt\n[110-kotlin]: ./src/_110/kotlin/Solution.kt\n[111-kotlin]: ./src/_111/kotlin/Solution.kt\n[112-kotlin]: ./src/_112/kotlin/Solution.kt\n[118-kotlin]: ./src/_118/kotlin/Solution.kt\n[119-kotlin]: ./src/_119/kotlin/Solution.kt\n[121-kotlin]: ./src/_121/kotlin/Solution.kt\n[122-kotlin]: ./src/_122/kotlin/Solution.kt\n[125-kotlin]: ./src/_125/kotlin/Solution.kt\n[136-kotlin]: ./src/_136/kotlin/Solution.kt\n[155-kotlin]: ./src/_155/kotlin/MinStack.kt\n[226-kotlin]: ./src/_226/kotlin/Solution.kt\n[504-kotlin]: ./src/_504/kotlin/Solution.kt\n[543-kotlin]: ./src/_543/kotlin/Solution.kt\n[771-kotlin]: ./src/_771/kotlin/Solution.kt\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FRichCodersAndMe%2FLeetCode-Solution","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FRichCodersAndMe%2FLeetCode-Solution","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FRichCodersAndMe%2FLeetCode-Solution/lists"}