Order Dependency

import java.util.*;
class Order{
    String orderName;
    public Order(String orderName)
    {
        this.orderName = orderName;
    }
}
class OrderDependency{
    Order order;
    Order dependent;
    public OrderDependency(Order order, Order dependent)
    {
        this.order = order;
        this.dependent = dependent;
    }
}
public class Solution {
    public static List<Order> findOrder(List<OrderDependency> depenency)
    {
        Map<String, Integer> inmap = new HashMap<>();
        Map<String, List<String>> outmap = new HashMap<>();
        for(OrderDependency i: depenency)
        {
            if(!inmap.containsKey(i.dependent.orderName)) inmap.put(i.dependent.orderName, 0);
            if(!inmap.containsKey(i.order.orderName)) inmap.put(i.order.orderName, 0);
            inmap.put(i.order.orderName, inmap.get(i.order.orderName) + 1);
            if(!outmap.containsKey(i.dependent.orderName)) outmap.put(i.dependent.orderName, new ArrayList<String>());
            outmap.get(i.dependent.orderName).add(i.order.orderName);
        }
        List<Order> res = new ArrayList<>();
        Queue<String> queue = new LinkedList<>();
        for(String i: inmap.keySet())
        {
            if(inmap.get(i) == 0) queue.offer(i);
        }
        while(!queue.isEmpty())
        {
            String s = queue.poll();
            res.add(new Order(s));
            if(outmap.containsKey(s))
            {
                for(String o: outmap.get(s))
                {
                    inmap.put(o, inmap.get(o) - 1);
                    if(inmap.get(o) == 0) queue.offer(o);
                }
            }
            outmap.remove(s);
        }
        return res;
    }
    public static void main(String[] args)
    {
        List<OrderDependency> input = new ArrayList<>();
        input.add(new OrderDependency(new Order("A"), new Order("E")));
        input.add(new OrderDependency(new Order("D"), new Order("E")));
        input.add(new OrderDependency(new Order("A"), new Order("C")));
        input.add(new OrderDependency(new Order("B"), new Order("D")));
        List<Order> output = findOrder(input);
        for(Order i: output) System.out.print(i.orderName + " ");
    }
}

最后編輯于
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時請結(jié)合常識與多方信息審慎甄別。
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點,簡書系信息發(fā)布平臺,僅提供信息存儲服務。

相關(guān)閱讀更多精彩內(nèi)容

友情鏈接更多精彩內(nèi)容