归档 2018

[LeetCode]Minimum Distance Between BST Nodes

题目描述:

LeetCode 783. Minimum Distance Between BST Nodes

Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.

Example :

Input: root = [4,2,6,1 ...

继续阅读

LeetCode Weekly Contest 70解题报告

LeetCode Weekly Contest 70是LeetCode举办的第七十四场正式周赛,共4道题目,比赛时长1.5小时。

比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-70/

题解列表:

LeetCode 779. K-th Symbol in Grammar

LeetCode 776. Split BST

LeetCode 777. Swap Adjacent in LR String

LeetCode 778. Swim in Rising Water

[LeetCode]Swap Adjacent in LR String

题目描述:

LeetCode 777. Swap Adjacent in LR String

In a string composed of 'L', 'R', and 'X' characters, like "RXXLRXRXL", a move consists of either replacing one occurrence of "XL" with "LX", or replacing one occurrence of "RX" with "XR" ...

继续阅读

每月存档

去年

明年