# Leetcode

**Repository Path**: love-for-poetry/Leetcode

## Basic Information

- **Project Name**: Leetcode
- **Description**: No description available
- **Primary Language**: Go
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 8
- **Forks**: 8
- **Created**: 2021-01-20
- **Last Updated**: 2022-02-15

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


LeetCode
### LeetCode Algorithm

| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|LeetCode 647|[回文子串](https://leetcode-cn.com/problems/palindromic-substrings/)|[JAVA](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/countSubstrings.java)|Medium|
|LeetCode 183|[从不订购的客户](https://leetcode-cn.com/problems/customers-who-never-order/)|[MySQL](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/mysql/NeverOrder.sql)|Easy|
|LeetCode 171|[Excel 表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/titleToNumber.go)|Easy|
|LeetCode 169|[多数元素](https://leetcode-cn.com/problems/majority-element/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/majorityElement.go)|Easy|
|LeetCode 168|[Excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/convertToTitle.go)|Easy|
|LeetCode 167|[两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/twoSumIndex.go)|Easy|
|LeetCode 160|[相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/getIntersectionNode.go)|Easy|
|LeetCode 155|[最小栈](https://leetcode-cn.com/problems/min-stack/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/MinStack.go)|Easy|
|LeetCode 145|[二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/postorderTraversal.go)|Easy|
|LeetCode 144|[二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/preorderTraversal.go)|Easy|
|LeetCode 141|[环形链表](https://leetcode-cn.com/problems/linked-list-cycle/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/hasCycle.go)|Easy|
|LeetCode 136|[只出现一次的数字](https://leetcode-cn.com/problems/single-number/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/singleNumber.go)|Easy|
|LeetCode 125|[验证回文串](https://leetcode-cn.com/problems/valid-palindrome/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/isPalindrome.go)|Easy|
|LeetCode 122|[买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/maxProfit2.go)|Easy|
|LeetCode 121|[买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/maxProfit.go)|Easy|
|LeetCode 119|[杨辉三角 II](https://leetcode-cn.com/problems/pascals-triangle-ii/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/getRow.go)|Easy|
|LeetCode 118|[杨辉三角](https://leetcode-cn.com/problems/pascals-triangle/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/generate.go)|Easy|
|LeetCode 112|[路径总和](https://leetcode-cn.com/problems/path-sum/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/hasPathSum.go)|Easy|
|LeetCode 111|[二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/minDepth.go)|Easy|
|LeetCode 110|[平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/isBalanced.go)|Easy|
|LeetCode 108|[将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/sortedArrayToBST.go)|Easy|
|LeetCode 104|[二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/maxDepth.go)|Easy|
|LeetCode 101|[对称二叉树](https://leetcode-cn.com/problems/symmetric-tree/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/isSymmetric.go)|Easy|
|LeetCode 100|[相同的树](https://leetcode-cn.com/problems/same-tree/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/isSameTree.go)|Easy|
|LeetCode 94|[二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/inorderTraversal.go)|Easy|
|LeetCode 88|[合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/mergeSortArray.java)|Easy|
|LeetCode 83|[删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/deleteDuplicates.go)|Easy|
|LeetCode 70|[爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/climbStairs.go)|Easy|
|LeetCode 69|[x 的平方根](https://leetcode-cn.com/problems/sqrtx/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/mySqrt.go)|Easy|
|LeetCode 67|[二进制求和](https://leetcode-cn.com/problems/add-binary/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/addBinary.go)|Easy|
|LeetCode 66|[加一](https://leetcode-cn.com/problems/plus-one/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/plusOne.go)|Easy|
|LeetCode 58|[最后一个单词的长度](https://leetcode-cn.com/problems/length-of-last-word/submissions/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/lengthOfLastWord.go)|Easy|
|LeetCode 53|[最大子序和](https://leetcode-cn.com/problems/maximum-subarray/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/maxSubArray.go)|Easy|
|LeetCode 52|[N 皇后 II](https://leetcode-cn.com/problems/n-queens-ii/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/totalNQueens.java)|hard|
|LeetCode 51|[N 皇后](https://leetcode-cn.com/problems/n-queens/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/solveNQueens.java)|hard|
|LeetCode 40|[组合总和II](https://leetcode-cn.com/problems/combination-sum-ii/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/combinationSum2.go)|Medium|
|LeetCode 39|[组合总和](https://leetcode-cn.com/problems/combination-sum/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/combinationSum.go)|Medium|
|LeetCode 38|[外观数列](https://leetcode-cn.com/problems/count-and-say/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/countAndSay.java),[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/countAndSay.go)|Medium|
|LeetCode 36|[有效的数独](https://leetcode-cn.com/problems/valid-sudoku/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/isValidSudoku.go)|Medium|
|LeetCode 35|[搜索插入位置](https://leetcode-cn.com/problems/search-insert-position/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/searchInsert.go)|Easy|
|LeetCode 33|[搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/search.go)|Medium|
|LeetCode 27|[移除元素](https://leetcode-cn.com/problems/remove-element/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/removeElement.java)|Easy|
|LeetCode 26|[删除有序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/removeDuplicates.java)|Easy|
|LeetCode 25|[K 个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/reverseKGroup.java)|hard|
|LeetCode 24|[两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/swapPairs.java)|Medium|
|LeetCode 23|[合并K个升序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/mergeKLists.java)|hard|
|LeetCode 22|[括号生成](https://leetcode-cn.com/problems/generate-parentheses/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/generateParenthesis.java)|Medium|
|LeetCode 21|[合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/mergeSortArray.java)|Easy|
|LeetCode 20|[有效的括号](https://leetcode-cn.com/problems/valid-parentheses/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/isValid.java)|Easy|
|LeetCode 19|[删除链表的倒数第 N 个结点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/removeNthFromEnd.java)|Medium|
|LeetCode 18|[四数之和](https://leetcode-cn.com/problems/4sum/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/fourSum.java)|Medium|
|LeetCode 17|[电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/letterCombinations.java)|Medium|
|LeetCode 16|[最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/threeSumClosest.java)|Medium|
|LeetCode 15|[三数之和](https://leetcode-cn.com/problems/3sum/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/threeSum.java)|Medium|
|LeetCode 14|[最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/longestCommonPrefix.java)|Easy|
|LeetCode 13|[罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/romanToInt.JAVA)|Easy|
|LeetCode 12|[整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/intToRoman.java)|Medium|
|LeetCode 11|[盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/maxArea.java)|Medium|
|LeetCode 9|[回文数](https://leetcode-cn.com/problems/palindrome-number/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/isPalindrome.java)|Easy|
|LeetCode 7|[整数反转](https://leetcode-cn.com/problems/reverse-integer/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/reverse.java)|Easy|
|LeetCode 6|[Z 字形变换](https://leetcode-cn.com/problems/zigzag-conversion/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/stringConvert.java)|Medium|
|LeetCode 5|[最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/longestPalindrome.java)|Medium|
|LeetCode 3|[无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/)|[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/maxNoRepetition.java)|Medium|
|LeetCode 2|[两数相加](https://leetcode-cn.com/problems/add-two-numbers/)|[Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/addTwoNumbers.go),[Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/addTwoNumbers.java)|Medium|
|LeetCode 1|[两数之和](https://leetcode-cn.com/problems/two-sum/)| [Go](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/go/src/twoSum.go), [Java](https://gitee.com/love-for-poetry/Leetcode/blob/love-for-poetry/code/java/src/twoSum.java)|Easy|