链滴
社区愿景和功能特性
优雅的 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
7
引用
Stack
11
引用 •
3
回帖
LeetCode
LeetCode
（力扣）是一个全球极客挚爱的高质量技术成长平台，想要学习和提升专业能力从这里开始，充足技术干货等你来啃，轻松拿下 Dream Offer！
209
引用 •
72
回帖
array
46
引用 •
4
回帖
默认
热议
好评
优选
最近回帖
关注者
查看所有标签
关于 SiYuan v3.1.12 后默认自动清理超过 180 天快照的调查
目前思源加入了自动的快照清理功能，触发时机如下： 手动触发同步 每 24 小时执行一次 默认的配置是保留 180 天内的快照，每天保留两份。 在启动、退出时的同步不会触发，但是 30s 的自动同步会触发。 我个人不喜欢这个设计，因此以下的描述可能会有偏颇。不喜欢的原因如下： 清理功能是自动的且没有开关默认开启，这导致假 ..
411
16 小时前
[每日 LeetCode] 1022. Sum of Root To Leaf Binary Numbers
原文链接 [每日 LeetCode] 1022. Sum of Root To Leaf Binary Numbers Description: Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a bi ..
524
5 年前
[每日 LeetCode] 83. Remove Duplicates from Sorted List
Description: Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Input: 1->1->2 Output: 1->2 Example ..
215
5 年前
[每日 LeetCode] 53. Maximum Subarray
Description： Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: I ..
241
5 年前
[9] Palindrome Number
[图片] 题目 Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. **Example 1:** **Input:** 121 **Out ..
149
5 年前
[每日 LeetCode] 206. Reverse Linked List
Description: Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked lis ..
170
5 年前
[每日 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
5 年前
[每日 LeetCode] 203. Remove Linked List Elements
Description: Remove all elements from a linked list of integers that have value val. Example: Input: 1->2->6->3->4->5->6, _**val**_ = 6 Output ..
106
5 年前
[每日 LeetCode] 707. Design Linked List
Description: Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked li ..
369
5 年前
[每日 LeetCode] 234. Palindrome Linked List
Description: Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false Example 2: Input: 1->2->2->1 Output: ..
164
5 年前
每日 LeetCode] 1021. Remove Outermost Parentheses
Description: A valid parentheses string is either empty (''),'(' + A + ')', or A + B, where A and B are valid parentheses strings, and + represents string conca ..
138
5 年前
每日 LeetCode] 844. Backspace String Compare
Description: Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character. Example 1: Input: S ..
111
5 年前
[每日 LeetCode] 682. Baseball Game
原文链接 [链接] Description: You're now a baseball game point recorder. Given a list of strings, each string can be one of the 4 following types: Integer (one round's ..
114
5 年前
[每日 LeetCode] 496. Next Greater Element I
原文链接 [链接] Description: You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbe ..
107
5 年前
[每日 LeetCode] 232. Implement Queue using Stacks
原文链接 [链接] Description: Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element ..
107
5 年前
[每日 LeetCode] 225. Implement Stack using Queues
原文链接 [链接] Description: Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of ..
86
5 年前
[每日 LeetCode] 155. Min Stack
原文链接 [链接] Description: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. p ..
94
5 年前
[每日 LeetCode] 20. Valid Parentheses
原文链接 [链接] Description: Given a string containing just the characters '(' , ')' , '{' , '}' , '[' and ']' , determine if the input string is valid. An input stri ..
103
5 年前
[每日 LeetCode] 993. Cousins in Binary Tree
原文链接 [每日 LeetCode] 993. Cousins in Binary Tree Description In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. Tw ..
176
5 年前
[每日 LeetCode] 965. Univalued Binary Tree
原文链接 [每日 LeetCode] 965. Univalued Binary Tree Description: A binary tree is univalued if every node in the tree has the same value. Return true if and only if t ..
172
5 年前
[每日 LeetCode] 938. Range Sum of BST
原文链接 [链接] Description: Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive). The binary sea ..
201
5 年前
[每日 LeetCode] 897. Increasing Order Search Tree
原文链接 [链接] Description: Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no lef ..
156
5 年前
[每日 LeetCode] 872. Leaf-Similar Trees
原文链接 [每日 LeetCode] 872. Leaf-Similar Trees Description: Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a le ..
145
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前
[每日 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
5 年前