摘要:
问题描述: Write a function: class Solution { public int solution(Tree T); } that, given a non-empty binary tree T consisting of N nodes, returns its heigh 阅读全文
摘要:
Level 1 - Process Validation1. maximum arrival countDefine the number of token instances the process will generate (or trigger)在一开始定义多少token将被处理2.Gate... 阅读全文
摘要:
WCP 1- SequenceThis pattern is used to model dependencies between tasks so that one task cannot start before another is finished (serial execution)WCP... 阅读全文
摘要:
就是一个键值对应的集合HashMap a = new HashMap(); a.put("name", "abcdef"); // key是name,value是字符串abcdef System.out.println(a.get("name"));// 根据key取得其值并输出 List l... 阅读全文