📜  找到与 X 的绝对差给出最小值的节点

📅  最后修改于: 2021-10-25 04:44:21             🧑  作者: Mango

给定一棵树,以及所有节点的权重和一个整数x ,任务是找到一个节点i使得|weight[i] – x|是最低限度。
例子:

方法:对树执行dfs并跟踪与x的加权绝对差给出最小值的节点。
下面是上述方法的实现:

C++
// C++ implementation of the approach
#include 
using namespace std;
 
int minimum = INT_MAX, x, ans;
 
vector graph[100];
vector weight(100);
 
// Function to perform dfs to find
// the minimum value
void dfs(int node, int parent)
{
    // If current value is less than
    // the current minimum
    if (minimum > abs(weight[node] - x)) {
        minimum = abs(weight[node] - x);
        ans = node;
    }
    for (int to : graph[node]) {
        if (to == parent)
            continue;
        dfs(to, node);
    }
}
 
// Driver code
int main()
{
    x = 15;
 
    // Weights of the node
    weight[1] = 5;
    weight[2] = 10;
    weight[3] = 11;
    weight[4] = 8;
    weight[5] = 6;
 
    // Edges of the tree
    graph[1].push_back(2);
    graph[2].push_back(3);
    graph[2].push_back(4);
    graph[1].push_back(5);
 
    dfs(1, 1);
 
    cout << ans;
 
    return 0;
}


Java
// Java implementation of the approach
import java.util.*;
import java.lang.*;
 
class GFG
{
 
    static int minimum = Integer.MAX_VALUE, x, ans;
 
    @SuppressWarnings("unchecked")
    static Vector[] graph = new Vector[100];
    static int[] weight = new int[100];
 
    // This block is executed even before main() function
    // This is necessary otherwise this program will
    // throw "NullPointerException"
    static
    {
        for (int i = 0; i < 100; i++)
            graph[i] = new Vector<>();
    }
 
    // Function to perform dfs to find
    // the minimum xored value
    static void dfs(int node, int parent)
    {
 
        // If current value is less than
        // the current minimum
        if (minimum > Math.abs(weight[node] - x))
        {
            minimum = Math.abs(weight[node] - x);
            ans = node;
        }
        for (int to : graph[node])
        {
            if (to == parent)
                continue;
            dfs(to, node);
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        x = 15;
 
        // Weights of the node
        weight[1] = 5;
        weight[2] = 10;
        weight[3] = 11;
        weight[4] = 8;
        weight[5] = 6;
 
        // Edges of the tree
        graph[1].add(2);
        graph[2].add(3);
        graph[2].add(4);
        graph[1].add(5);
 
        dfs(1, 1);
 
        System.out.println(ans);
    }
}
 
// This code is contributed by SHUBHAMSINGH10


Python3
# Python3 implementation of the approach
from sys import maxsize
 
# Function to perform dfs to find
# the minimum value
def dfs(node, parent):
    global minimum, graph, weight, x, ans
 
    # If current value is less than
    # the current minimum
    if minimum > abs(weight[node] - x):
        minimum = abs(weight[node] - x)
        ans = node
 
    for to in graph[node]:
        if to == parent:
            continue
        dfs(to, node)
 
# Driver Code
if __name__ == "__main__":
    minimum = maxsize
    graph = [[] for i in range(100)]
    weight = [0] * 100
    x = 15
    ans = 0
 
    # Weights of the node
    weight[1] = 5
    weight[2] = 10
    weight[3] = 11
    weight[4] = 8
    weight[5] = 6
 
    # Edges of the tree
    graph[1].append(2)
    graph[2].append(3)
    graph[2].append(4)
    graph[1].append(5)
 
    dfs(1, 1)
 
    print(ans)
 
# This code is contributed by
# sanjeev2552


C#
// C# implementation of the approach
using System;
using System.Collections.Generic;
     
class GFG
{
 
static int minimum = int.MaxValue, x, ans;
 
static List> graph = new List>();
static List weight = new List();
 
// Function to perform dfs to find
// the minimum value
static void dfs(int node, int parent)
{
    // If current value is more than
    // the current minimum
    if (minimum > Math.Abs(weight[node] - x))
    {
        minimum = Math.Abs(weight[node] - x);
        ans = node;
    }
    for (int i = 0; i < graph[node].Count; i++)
    {
        if (graph[node][i] == parent)
            continue;
        dfs(graph[node][i], node);
    }
}
 
// Driver code
public static void Main(String []args)
{
    x = 15;
 
    // Weights of the node
    weight.Add(0);
    weight.Add(5);
    weight.Add(10);;
    weight.Add(11);;
    weight.Add(8);
    weight.Add(6);
     
    for(int i = 0; i < 100; i++)
    graph.Add(new List());
 
    // Edges of the tree
    graph[1].Add(2);
    graph[2].Add(3);
    graph[2].Add(4);
    graph[1].Add(5);
 
    dfs(1, 1);
 
    Console.WriteLine( ans);
}
}
 
// This code is contributed by shubhamsingh10


Javascript


输出:
3

复杂度分析:

  • 时间复杂度: O(N)。
    在 dfs 中,树的每个节点都被处理一次,因此如果树中总共有 N 个节点,则由于 dfs 的复杂性是 O(N)。因此,时间复杂度为 O(N)。
  • 辅助空间: O(1)。
    不需要任何额外的空间,因此空间复杂度是恒定的。

如果您希望与专家一起参加现场课程,请参阅DSA 现场工作专业课程学生竞争性编程现场课程