46 lines
1.4 KiB
Java
46 lines
1.4 KiB
Java
|
/**
|
|||
|
|
* Copyright (c) 2018-2028, Chill Zhuang 庄骞 (smallchill@163.com).
|
|||
|
|
* <p>
|
|||
|
|
* Licensed under the GNU LESSER GENERAL PUBLIC LICENSE;
|
|||
|
|
* you may not use this file except in compliance with the License.
|
|||
|
|
* You may obtain a copy of the License at
|
|||
|
|
* <p>
|
|||
|
|
* http://www.gnu.org/licenses/lgpl.html
|
|||
|
|
* <p>
|
|||
|
|
* Unless required by applicable law or agreed to in writing, software
|
|||
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|||
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|||
|
|
* See the License for the specific language governing permissions and
|
|||
|
|
* limitations under the License.
|
|||
|
|
*/
|
|||
|
|
package org.springblade.core.boot.node;
|
|||
|
|
|
|||
|
|
import java.util.List;
|
|||
|
|
|
|||
|
|
/**
|
|||
|
|
* 森林节点归并类
|
|||
|
|
*
|
|||
|
|
* @author zhuangqian
|
|||
|
|
*/
|
|||
|
|
public class ForestNodeMerger {
|
|||
|
|
|
|||
|
|
/**
|
|||
|
|
* 将节点数组归并为一个森林（多棵树）（填充节点的children域）
|
|||
|
|
* 时间复杂度为O(n^2)
|
|||
|
|
*
|
|||
|
|
* @param items 节点域
|
|||
|
|
* @return 多棵树的根节点集合
|
|||
|
|
*/
|
|||
|
|
public static List<INode> merge(List<INode> items) {
|
|||
|
|
ForestNodeManager forestNodeManager = new ForestNodeManager(items);
|
|||
|
|
for (INode forestNode : items) {
|
|||
|
|
if (forestNode.getParentId() != 0) {
|
|||
|
|
INode node = forestNodeManager.getTreeNodeAT(forestNode.getParentId());
|
|||
|
|
node.getChildren().add(forestNode);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
return forestNodeManager.getRoot();
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
}
|