zoukankan      html  css  js  c++  java
  • [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 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.

    思路:

    用set存储遍历的值。取第二个即可。但是感觉不是什么好办法。。。以为么有利用树的结构信息。。暂时先这样。。

    void pret(TreeNode*root, set<int>&s)
    {
        if (root == NULL)return;
        s.insert(root->val);
        pret(root->left, s);
        pret(root->right, s);    
    }
    int findSecondMinimumValue(TreeNode* root)
    {
        if (root == NULL)return -1;
        set<int>s;
        pret(root, s);
        if (s.size() < 2)return -1;
        auto it = s.begin();
        it++;
        return *it;
    }
  • 相关阅读:
    Oracle 经典语法(三)
    String.format() 方法的用处
    window 官网下载系统
    微信小程序在wxml中调用自定义函数
    前后端分离 poi使用
    微信分享
    微信支付 (jsapi 方式)
    tomcat配置多个ssl证书
    netty websocket集群下遇到的问题
    CompletableFuture 简介和使用
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/7469166.html
Copyright © 2011-2022 走看看