https://github.com/tohsaka888/leetcode-hot-100

leetcode刷题
https://github.com/tohsaka888/leetcode-hot-100

leetcode typescript

Last synced: 9 days ago
JSON representation

leetcode刷题

• Host: GitHub
• URL: https://github.com/tohsaka888/leetcode-hot-100
• Owner: tohsaka888
• Created: 2022-10-26T01:28:56.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2024-09-14T05:52:36.000Z (2 months ago)
• Last Synced: 2024-09-14T22:24:05.023Z (2 months ago)
• Topics: leetcode, typescript
• Language: TypeScript
• Homepage:
• Size: 48.8 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 3
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## leetcode-hot-100

推荐使用`deno`运行测试

- [两数之和](/two-sum)

- [两数相加](/add-two-numbers)

- [只出现一次的数字](/single-number)

- [二叉树的先序遍历](/binary-tree-preorder-traversal)

- [二叉树的中序遍历](/binary-tree-inorder-traversal)

- [二叉树的后续遍历](/binary-tree-postorder-traversal)

- [N 叉树的先序遍历](/n-ary-tree-preorder-traversal)

- [N 叉树的后序遍历](/n-ary-tree-postorder-traversal)

- [N 叉树的最大深度](/maximum-depth-of-n-ary-tree)

- [相同的树](/same-tree)

- [二叉树展开为链表](/flatten-binary-tree-to-linked-list)

- [无重复的最长字串](/longest-substring-without-repeating-characters)

- [二叉树的层序遍历](/binary-tree-level-order-traversal)

- [二叉树的层序遍历 II](/binary-tree-level-order-traversal-ii)

- [二叉树的锯齿层序遍历](/binary-tree-zigzag-level-order-traversal)

- [左叶子之和](/sum-of-left-leaves)

- [验证二叉搜索树](/validate-binary-search-tree)

- [恢复二叉搜索树](/recover-binary-search-tree)

- [将有序数组转换为二叉搜索树](/convert-sorted-array-to-binary-search-tree)

- [有序链表转换二叉搜索树](/convert-sorted-list-to-binary-search-tree)