zoukankan      html  css  js  c++  java
  • LeetCode 671. Second Minimum Node In a Binary Tree

    原题链接在这里:https://leetcode.com/problems/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 sub-nodes, then this node's value is the smaller value among its two sub-nodes.

    Given such a binary tree, you need to output the second minimum value in the set made of all the nodes' value in the whole tree.

    If no such second minimum value exists, output -1 instead.

    Example 1:

    Input: 
        2
       / 
      2   5
         / 
        5   7
    
    Output: 5
    Explanation: The smallest value is 2, the second smallest value is 5.

    Example 2:

    Input: 
        2
       / 
      2   2
    
    Output: -1
    Explanation: The smallest value is 2, but there isn't any second smallest value.

    题解:

    If current root or root.left == null, then return -1.

    Otherwise, check root.left.val and root.right.val, if they != root.val, it must be larger than root.val, could be candidate.

    Otherwise, continue dfs on the side == root.val. 

    If both sides != -1, return min, otherwise, return max.

    Time Complexity: O(n). Space: O(logn).

    AC Java:

     1 /**
     2  * Definition for a binary tree node.
     3  * public class TreeNode {
     4  *     int val;
     5  *     TreeNode left;
     6  *     TreeNode right;
     7  *     TreeNode(int x) { val = x; }
     8  * }
     9  */
    10 class Solution {
    11     public int findSecondMinimumValue(TreeNode root) {
    12         if(root == null || root.left == null){
    13             return -1;
    14         }
    15         
    16         int l = root.left.val;
    17         int r = root.right.val;
    18         if(l == root.val){
    19             l = findSecondMinimumValue(root.left);
    20         }
    21         
    22         if(r == root.val){
    23             r = findSecondMinimumValue(root.right);
    24         }
    25         
    26         if(l > 0 && r > 0){
    27             return Math.min(l, r);
    28         }else if(l > 0){
    29             return l;
    30         }else if(r > 0){
    31             return r;
    32         }else{
    33             return -1;
    34         }
    35     }
    36 }
  • 相关阅读:
    4.代理模式
    替换文中指定字段实例
    常用正则表达式
    1.简单工厂模式
    ftp 发生意外错误 0x8ffe2740
    《人月神话》1
    3.装饰模式
    简易JS版多级菜单
    UEditor 百度富文本编辑器
    奉献一个窗口置顶的小工具
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/7530380.html
Copyright © 2011-2022 走看看