tag:blogger.com,1999:blog-2084836737143870236.post2611082615228541994..comments2023-07-31T02:13:31.085-07:00Comments on 喜刷刷: [LeetCode] Validate Binary Search TreeYanbing Shihttp://www.blogger.com/profile/16541941455216571610noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-2084836737143870236.post-26104692828986655192019-08-31T14:14:09.727-07:002019-08-31T14:14:09.727-07:00第二种解法貌似不能通过 input 仅为 INT_MIN的情况
要把 curMax 类型设为 lon...第二种解法貌似不能通过 input 仅为 INT_MIN的情况<br />要把 curMax 类型设为 long 并且初始化为 INT_MIN - 1Anonymoushttps://www.blogger.com/profile/10159913330431872942noreply@blogger.comtag:blogger.com,1999:blog-2084836737143870236.post-76617341663759269902016-12-11T16:35:08.574-08:002016-12-11T16:35:08.574-08:00大家好 我是一个兔子大家好 我是一个兔子Anonymoushttps://www.blogger.com/profile/16620156662389401707noreply@blogger.comtag:blogger.com,1999:blog-2084836737143870236.post-15063030831634106992015-03-24T16:00:55.091-07:002015-03-24T16:00:55.091-07:00第一种解法不能通过root 就是int_max 的 test case,branch left 过刚...第一种解法不能通过root 就是int_max 的 test case,branch left 过刚比较max, branch right 过就比较min可以过 <br />http://fisherlei.blogspot.com/2013/01/leetcode-validate-binary-search-tree.htmlAnonymoushttps://www.blogger.com/profile/04673530671329598227noreply@blogger.com