摘要：
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. 阅读全文
posted @ 2017-09-03 12:40
hellowOOOrld
阅读(712)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2017-09-03 11:54
hellowOOOrld
阅读(561)
评论(0)
推荐(0)
摘要：
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. 阅读全文
posted @ 2017-09-03 11:32
hellowOOOrld
阅读(295)
评论(0)
推荐(0)
浙公网安备 33010602011771号