题目描述：
Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get.
Example 1:
Input: 2736 Output: 7236 Explanation: Swap the ...
标签归档：leetcode
[LeetCode]Maximum Swap
[LeetCode]Trim a Binary Search Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 669. Trim a Binary Search Tree
Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might ...
[LeetCode]Second Minimum Node In a Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 671. Second Minimum Node In a Binary Tree
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 zero sub-node. If the node has two ...
LeetCode Weekly Contest 47解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 47是LeetCode举办的第五十二场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-47/
题解列表：
LeetCode 665. Non-decreasing Array
[LeetCode]Kth Smallest Number in Multiplication Table
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 668. Kth Smallest Number in Multiplication Table
Nearly every one have used the Multiplication Table. But could you find out the k-th smallest number quickly from the multiplication table?
Given the height m and the length n of ...