设计模式-组合模式

Author: dolyw

DesignPattern/src/main/java/com/design/composite/v1/Employee.java

@@ -0,0 +1,42 @@
+package com.design.composite.v1;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 创建 Employee 类，该类带有 Employee 对象的列表
+ *
+ * @author wliduo[i@dolyw.com]
+ * @date 2023/1/31 14:07
+ */
+public class Employee {
+    private String name;
+    private String dept;
+    private int salary;
+    private List<Employee> subordinates;
+
+    public Employee(String name, String dept, int sal) {
+        this.name = name;
+        this.dept = dept;
+        this.salary = sal;
+        subordinates = new ArrayList<>();
+    }
+
+    public void add(Employee e) {
+        subordinates.add(e);
+    }
+
+    public void remove(Employee e) {
+        subordinates.remove(e);
+    }
+
+    public List<Employee> getSubordinates() {
+        return subordinates;
+    }
+
+    public String toString() {
+        return ("Employee :[ Name : " + name
+                + ", dept : " + dept + ", salary :"
+                + salary + " ]");
+    }
+}

DesignPattern/src/main/java/com/design/composite/v1/Main.java

@@ -0,0 +1,45 @@
+package com.design.composite.v1;
+
+/**
+ * 组合模式
+ *
+ * 使用 Employee 类来创建和打印员工的树形层次结构
+ *
+ * @author wliduo[i@dolyw.com]
+ * @date 2023/1/31 14:07
+ */
+public class Main {
+
+    public static void main(String[] args) {
+        Employee Ceo = new Employee("王明", "CEO", 30000);
+
+        Employee headSales = new Employee("销售主管", "销售部门", 20000);
+
+        Employee headMarketing = new Employee("营销主管", "营销部门", 20000);
+
+        Employee clerk1 = new Employee("文员1", "营销部门", 10000);
+        Employee clerk2 = new Employee("文员2", "营销部门", 10000);
+
+        Employee sales1 = new Employee("销售1", "销售部门", 10000);
+        Employee sales2 = new Employee("销售2", "销售部门", 10000);
+
+        Ceo.add(headSales);
+        Ceo.add(headMarketing);
+
+        headSales.add(sales1);
+        headSales.add(sales2);
+
+        headMarketing.add(clerk1);
+        headMarketing.add(clerk2);
+
+        // 打印该组织的所有员工
+        System.out.println(Ceo);
+        for (Employee headEmployee : Ceo.getSubordinates()) {
+            System.out.println(headEmployee);
+            for (Employee employee : headEmployee.getSubordinates()) {
+                System.out.println(employee);
+            }
+        }
+    }
+
+}

DesignPattern/src/main/java/com/design/composite/v2/BranchNode.java

@@ -0,0 +1,29 @@
+package com.design.composite.v2;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 分支节点
+ *
+ * @author wliduo[i@dolyw.com]
+ * @date 2023/1/31 14:15
+ */
+class BranchNode extends Node {
+    List<Node> nodes = new ArrayList<>();
+
+    String name;
+
+    public BranchNode(String name) {
+        this.name = name;
+    }
+
+    @Override
+    public void p() {
+        System.out.println(name);
+    }
+
+    public void add(Node n) {
+        nodes.add(n);
+    }
+}

DesignPattern/src/main/java/com/design/composite/v2/LeafNode.java

@@ -0,0 +1,22 @@
+package com.design.composite.v2;
+
+/**
+ * 叶子节点
+ *
+ * @author wliduo[i@dolyw.com]
+ * @date 2023/1/31 14:15
+ */
+public class LeafNode extends Node {
+
+    String content;
+
+    public LeafNode(String content) {
+        this.content = content;
+    }
+
+    @Override
+    public void p() {
+        System.out.println(content);
+    }
+
+}

DesignPattern/src/main/java/com/design/composite/v2/Main.java

@@ -0,0 +1,52 @@
+package com.design.composite.v2;
+
+/**
+ * 组合模式
+ *
+ * 模拟树形层次结构输出
+ *
+ * @author wliduo[i@dolyw.com]
+ * @date 2023/1/31 14:07
+ */
+public class Main {
+
+    public static void main(String[] args) {
+
+        BranchNode root = new BranchNode("章节");
+        BranchNode chapter1 = new BranchNode("章节1");
+        BranchNode chapter2 = new BranchNode("章节2");
+        Node r1 = new LeafNode("尾声");
+        Node c11 = new LeafNode("小结1-1");
+        Node c12 = new LeafNode("小结1-2");
+        BranchNode b21 = new BranchNode("选读1");
+        Node c211 = new LeafNode("选读1小结1");
+        Node c212 = new LeafNode("选读1小结2");
+
+        root.add(chapter1);
+        root.add(chapter2);
+        root.add(r1);
+        chapter1.add(c11);
+        chapter1.add(c12);
+        chapter2.add(b21);
+        b21.add(c211);
+        b21.add(c212);
+
+        tree(root, 0);
+
+    }
+
+    public static void tree(Node b, int depth) {
+        for (int i = 0; i < depth; i++) {
+            System.out.print("--");
+        }
+
+        b.p();
+
+        if (b instanceof BranchNode) {
+            for (Node n : ((BranchNode) b).nodes) {
+                tree(n, depth + 1);
+            }
+        }
+    }
+
+}

DesignPattern/src/main/java/com/design/composite/v2/Node.java

@@ -0,0 +1,13 @@
+package com.design.composite.v2;
+
+/**
+ * 节点
+ *
+ * @author wliduo[i@dolyw.com]
+ * @date 2023/1/31 14:15
+ */
+abstract public class Node {
+
+    abstract public void p();
+
+}