# Leetcode

**Repository Path**: no-998-only-996/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**: 0
- **Forks**: 8
- **Created**: 2021-04-12
- **Last Updated**: 2021-04-12

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


LeetCode
### LeetCode Algorithm

| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|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 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 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|