https://github.com/iceopen/leetcode

力扣 (LeetCode) - 全球极客挚爱的技术成长平台
https://github.com/iceopen/leetcode

go leetcode

Last synced: about 2 months ago
JSON representation

力扣 (LeetCode) - 全球极客挚爱的技术成长平台

• Host: GitHub
• URL: https://github.com/iceopen/leetcode
• Owner: iceopen
• License: mit
• Created: 2019-02-25T14:20:26.000Z (about 7 years ago)
• Default Branch: master
• Last Pushed: 2022-03-11T05:55:07.000Z (about 4 years ago)
• Last Synced: 2024-06-20T10:14:55.823Z (almost 2 years ago)
• Topics: go, leetcode
• Language: Go
• Size: 54.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# leetcode

力扣 (LeetCode) - 全球极客挚爱的技术成长平台

[![Build Status](https://cloud.drone.io/api/badges/iceopen/leetcode/status.svg)](https://cloud.drone.io/iceopen/leetcode)

[![Go Report Card](https://goreportcard.com/badge/github.com/iceopen/leetcode)](https://goreportcard.com/report/github.com/iceopen/leetcode)

## 题目列表

|题号|题目|难度|

| --- | --- | --- |

|[1](https://leetcode-cn.com/problems/two-sum/)|[两数之和](./algorithms/1-two-sum)|简单|

|[2](https://leetcode-cn.com/problems/add-two-numbers/)|[两数相加](./algorithms/1-add-two-numbers)|中等|

|[3](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters)|[无重复字符的最长子串](./algorithms/3-longest-substring-without-repeating-characters)|中等|

|[4](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/)|[寻找两个有序数组的中位数](./algorithms/4-median-of-two-sorted-arrays)|困难|

|[5](https://leetcode-cn.com/problems/longest-palindromic-substring/)|[最长回文子串](./algorithms/5-longest-palindromic-substring/)|中等|

|[6](https://leetcode-cn.com/problems/zigzag-conversion/)|[Z 字形变换](./algorithms/6-zigzag-conversion)|中等|

|[7](https://leetcode-cn.com/problems/reverse-integer/)|[整数反转](./algorithms/2-reverse-integer)|简单|

|[9](https://leetcode-cn.com/problems/palindrome-number/)|[回文数](./algorithms/9-palindrome-number)|简单|

|[13](https://leetcode-cn.com/problems/roman-to-integer/)|[罗马数字转整数](./algorithms/13-roman-to-integer)|简单|

|[14](https://leetcode-cn.com/problems/longest-common-prefix/)|[回文数](./algorithms/14-longest-common-prefix)|简单|

|[36](https://leetcode-cn.com/problems/valid-sudoku/)|[有效的数独](./algorithms/36-valid-sudoku)|中等|

|[20](https://leetcode-cn.com/problems/valid-parentheses/)|[有效的括号](./algorithms/20-vvalid-parentheses)|简单|

|[283](https://leetcode-cn.com/problems/move-zeroes/)|[移动零](./algorithms/283-move-zeroes)|简单|

|[344](https://leetcode-cn.com/problems/reverse-string/)|[反转字符串](./algorithms/344-reverse-string)|简单|

|[387](https://leetcode-cn.com/problems/first-unique-character-in-a-string/)|[字符串中的第一个唯一字符](./algorithms/387-first-unique-character-in-a-string)|简单|

|[665](https://leetcode-cn.com/problems/non-decreasing-array/)|[非递减数列](./algorithms/665-non-decreasing-array)|简单|

|[976](https://leetcode-cn.com/problems/largest-perimeter-triangle/)|[整数反转](./algorithms/976-largest-perimeter-triangle)|简单|

## 参考资料

- [时间复杂度](https://zh.wikipedia.org/wiki/%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6)