链滴
社区愿景和功能特性
优雅的 Markdown 所见即所得编辑
快捷键交互
随时自由编辑分享内容
支持注销账号来去自由
分布式社区网络
开放 API
产品
Symphony 社区系统（Java）
Solo 博客系统（Java）
Vditor 编辑器（TypeScript）
思源笔记（Electron、Go）
Pipe 博客平台（Vue、Go）
发展计划表
发展简史
榜单
GitHub 仓库排行
帖子打赏排行
Solo 博客端排行
积分排行
活跃度排行
贡献排行
本站基于开源项目 Sym
编程代码问答
登录
注册
首页
>
标签
Easy
101
引用 •
10
回帖 •
453
浏览
参与讨论
关注
关注
分享
Tree
35
引用 •
6
回帖
LinkList
9
引用 •
3
回帖
sort
4
引用
String
6
引用
Stack
11
引用 •
3
回帖
LeetCode
LeetCode
（力扣）是一个全球极客挚爱的高质量技术成长平台，想要学习和提升专业能力从这里开始，充足技术干货等你来啃，轻松拿下 Dream Offer！
209
引用 •
72
回帖
array
46
引用 •
4
回帖
默认
热议
好评
优选
最近回帖
关注者
查看所有标签
思源笔记 v3.0.10 发布，改进数据索引
概述 该版本改进了数据索引和数据库视图相关细节。 变更记录 以下是此版本中的详细变更。 改进功能 [链接] [链接] [链接] [链接] [链接] [链接] [链接] 编辑文档时改进数据索引性能 Ctrl+Shift+F 不再叠加关键字 改进移动设备上的左右滑动 改进在代码、标签和键盘之前 Del 导入 .sy.zip ..
991
3 天前
[每日 LeetCode] 13. Roman to Integer
原文链接 [链接] Description: Roman numerals are represented by seven different symbols: I , V , X , L , C , D and M . Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 100 ..
176
4 年前
[每日 LeetCode] 709. To Lower Case
原文链接 [链接] Description: Implement function ToLowerCase( ) that has a string parameter str, and returns the same string in lowercase. Example 1: Input: 'Hello' Ou ..
131
4 年前
[每日 LeetCode] 929. Unique Email Addresses
原文链接 [链接] Description: Every email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com , alice is the local ..
371
4 年前
[每日 LeetCode] 893. Groups of Special-Equivalent Strings
原文链接 [链接] Description: You are given an array A of strings. Two strings S and T are special-equivalent if after any number of moves, S == T. A move consists of ..
558
4 年前
[每日 LeetCode] 441. Arranging Coins
原文链接 [链接] Description: You have a total of_n_coins that you want to form in a staircase shape, where every k -th row must have exactly k coins. Given n , find t ..
161
4 年前
[每日 LeetCode] 242. Valid Anagram
原文链接 [链接] Description: Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Input: s = 'anagram', t = 'nagaram' Output: ..
137
4 年前
[每日 LeetCode] 350. Intersection of Two Arrays II
原文链接 [链接] Description: Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] Exampl ..
124
4 年前
[每日 LeetCode] 349. Intersection of Two Arrays
原文链接 [链接] Description: Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2] Example ..
161
4 年前
[每日 LeetCode] 543. Diameter of Binary Tree
原文链接 [链接] Description: Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of thelonges ..
164
4 年前
[每日 LeetCode] 559. Maximum Depth of N-ary Tree
原文链接 [每日 LeetCode] 559. Maximum Depth of N-ary Tree Description: Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the ..
167
4 年前
[每日 LeetCode] 101. Symmetric Tree
原文链接 [链接] Description: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4 ..
134
4 年前
[每日 LeetCode] 108. Convert Sorted Array to Binary Search Tree
原文链接 [链接] Description: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bin ..
153
4 年前
[每日 LeetCode] 687. Longest Univalue Path
原文链接 [链接] Description: Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass th ..
207
4 年前
[每日 LeetCode] 111. Minimum Depth of Binary Tree
原文链接 [链接] Description: Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to ..
122
4 年前
[每日 LeetCode] 637. Average of Levels in Binary Tree
原文链接 [链接] Description: Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: Input: 3 / \ 9 20 ..
166
4 年前
[每日 LeetCode] 530. Minimum Absolute Difference in BST
原文链接 [链接] Description: Given a binary search tree with non-negative values, find the minimum [链接] between values of any two nodes. Example: Input: 1 \ 3 / 2 Out ..
133
4 年前
[每日 LeetCode] 110. Balanced Binary Tree
原文链接 [链接] Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep ..
122
4 年前
[每日 LeetCode] 257. Binary Tree Paths
原文链接 [链接] Description: Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Input: 1 / \ 2 3 \ 5 Output: ['1-&g ..
115
4 年前
[每日 LeetCode] 671. Second Minimum Node In a Binary Tree
原文链接 [链接] Description: Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or ze ..
100
4 年前
[每日 LeetCode] 429. N-ary Tree Level Order Traversal
原文链接 [每日 LeetCode] 429. N-ary Tree Level Order Traversal Description: Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left ..
130
4 年前
[每日 LeetCode] 107. Binary Tree Level Order Traversal II
原文链接 [链接] Description: Given a binary tree, return the_bottom-up level order_traversal of its nodes' values. (ie, from left to right, level by level from leaf t ..
150
4 年前
[每日 LeetCode] 102. Binary Tree Level Order Traversal
原文链接 [链接] Description: Given a binary tree, return the_level order_traversal of its nodes' values. (ie, from left to right, level by level). For example: Given ..
151
4 年前
[每日 LeetCode] 404. Sum of Left Leaves
原文链接 [链接] Description: Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with v ..
124
4 年前
[每日 LeetCode] 112. Path Sum
原文链接 [链接] Description: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the ..
101
4 年前
[每日 LeetCode] 226. Invert Binary Tree
原文链接 [链接] Description: Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by [链 ..
172
4 年前
[每日 LeetCode] 572. Subtree of Another Tree
原文链接 [链接] Description: Given two non-empty binary trees s and t , check whether tree t has exactly the same structure and node values with a subtree of s. A sub ..
325
4 年前
[每日 LeetCode] 100. Same Tree
原文链接 [链接] Description: Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are struc ..
117
4 年前
[每日 LeetCode] 104. Maximum Depth of Binary Tree
原文链接 [链接] Description: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to t ..
141
4 年前
[每日 LeetCode] 653. Two Sum IV - Input is a BST
原文链接 [链接] Description: Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the gi ..
121
4 年前
[每日 LeetCode] 700. Search in a Binary Search Tree
原文链接 [链接] Description: Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the give ..
142
4 年前
[每日 LeetCode] 783. Minimum Distance Between BST Nodes
原文链接 [链接] Description: Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in ..
197
4 年前