标签：时习 树结构 List SoloNode private import new 多线程 id
前言
3月的天, 阴沉沉, 灰蒙蒙, 如忆起往事时心底激荡起伏, 过后不经意间地洒下的几滴细雨. 在本适合出门踏青的周末, 张大胖选择了睡懒觉. 忽暗忽明的微光穿过门窗, 撒在他的大肚腩上, 抚慰着一周996过后的疲惫, 现已到半晌, 隔壁洗衣机的螺旋桨突然轰隆隆的转起来, 如一头见了红布的公牛样咆哮着. 这可打扰了大胖的美梦, 他强忍着睡意睁开双眼, 一时间昨晚难缠的需求涌上心来, “动态生成秒开的多Tab异形树的营销统计详情页”. 这虽然是个前端的事, 但是要调的接口太多了, 干脆由后端用模板引擎渲染好了返回, 以往只要大胖提供接口就行了, 现在到好, 要调小十来个接口, 才能满足多Tab的要求, 这倒是好说, 多堆时间就可以了, 但是还要去处理麻烦的异形树结构, 这让上数据结构课就像听天书的大胖伤透了脑筋.
大胖不满的撅起嘴说道: “一切全都怪产品经理 Lisa 这个坏女人, 提的无理需求!”
俗话说的好, 只有懒程序员, 没有笨程序员, 大胖急中生智拿起电话打给了我,
我说: " 遇事不决, 量子力学, 我是 LeetCode 第一题都刷不过的人, 找我没用, 咱们找 Mason 大神, 一起开个线上会议吧".
大胖听完调侃道: “就这你还天天写技术文章吹牛呢? 这第一题我三个小时就解出来了,只是想讨论个最佳的实现方案, 才问问你滴, 不然就和你说话这功夫, 我代码都写完了”.
虽然嘴上这么说, 行动却很诚实, 我被大胖匆忙邀请进了线上会议.
和 Mason 大神说完情况后, 他深沉的吟诵了一首定场诗.
南轩松 【朝代】 唐
南轩有孤松，柯叶自绵幂。
清风无闲时，潇洒终日夕。
阴生古苔绿，色染秋烟碧。
何当凌云霄，直上数千尺。
一对多树结构
对一般业务来说树形结构是在展示数据的适合需要, 而在增删改时则提前设计好一张或者多张表, 比如系统权限相关的用户表,角色表,权限表等, 这方面就不展开了, 最终通过业务主键的关联形成一颗抽象的树, 而这些树的结构大多是一个树枝(ParentNode)对应几个下级树枝(Node)在逐渐繁衍以此类推, 可能树枝下面挂着同一种果实(Object,List,Map), 但这与树的生长无关. 那么我们如何360°无死角的环视这颗树呢?
用抽象代码类比登录admin 时涉及的后台系统权限, 来一探究竟!
// pojo and enum
/**
* 一对多权限Node
*/
@Data
public class SoloNode {
private Integer id ;
private Integer permissionLevelEnum;
private Integer parentId;
private PermissionResource permissionResource;
private List<SoloNode> children;
public SoloNode(Integer id, Integer permissionLevelEnum, Integer parentId, PermissionResource permissionResource) {
this.id = id;
this.permissionLevelEnum = permissionLevelEnum;
this.parentId = parentId;
this.permissionResource = permissionResource;
}
}
/**
* 权限相关的前端对应展示资源
*/
@Data
@AllArgsConstructor
public class PermissionResource {
private String name;
private String routePath;
private String helpDescription;
private String iconName;
private String iconType;
}
/**
* 权限的层级关系Enum
*/
public enum PermissionLevelEnum implements BasicEnum {
PERMISSION_MENU(1, "权限菜单"),
FINE_GRIT_PERMISSION(2, "细粒度权限");
private Integer code;
private String description;
PermissionLevelEnum(final Integer code, final String description) {
this.code = code;
this.description = description;
}
@Override
public Integer getCode() {
return code;
}
@Override
public String getDescription() {
return description;
}
}
从这颗 SoloNode 树的属性可以看出来, 这是颗父子单层关联树. 因为没有预留多余的标记属性(如果要多层关联会比较麻烦). 那么我们来看看如何完全的展示出它吧 !
import studey.advance.datastructure.tree.SoloNode;
import java.util.ArrayList;
import java.util.List;
/**
* Created by 刷题使我快乐,自律使我自由 !
*/
public class SoloTreeCompleteSolution {
/**
* 展示多颗完整的一对多 Tree
* @param nodeList 构建树的子节点
* @return TreeList
*/
protected List<SoloNode> viewCompleteSoloTree(List<SoloNode> nodeList){
List<SoloNode> soloTreeList = new ArrayList<>();
for(SoloNode Node : getRootNode(nodeList)) {
SoloNode nodex = buildChilTree(Node,nodeList);
soloTreeList.add(nodex);
}
return soloTreeList;
}
/**
* 为每个父节点递归 buildChilTree，建立子树形结构
* @param pNode 需递归的父节点
* @param nodeList 需递归的nodelist
* @return 父节点Tree
*/
private SoloNode buildChilTree(SoloNode pNode,List<SoloNode> nodeList){
List<SoloNode> chils = new ArrayList<>();
for(SoloNode Node : nodeList) {
if(Node.getParentId().equals(pNode.getId())) {
chils.add(buildChilTree(Node,chils));
}
}
pNode.setChildren(chils);
return pNode;
}
/**
* 获取根节点 rootLists
* @param nodeList 全部节点list
* @return 根节点list
*/
private List<SoloNode> getRootNode(List<SoloNode> nodeList) {
List<SoloNode> rootLists = new ArrayList<>();
for(SoloNode node : nodeList) {
if (node.getParentId().equals(-1)) {
rootLists.add(node);
}
}
return rootLists;
}
}
测试用例如下
import org.junit.jupiter.api.Test;
import studey.advance.datastructure.enums.PermissionLevelEnum;
import studey.advance.datastructure.pojo.PermissionResource;
import studey.advance.datastructure.tree.SoloNode;
import studey.advance.datastructure.utils.JsonUtil;
import studey.advance.questiontypes.tree.SoloTreeCompleteSolution;
import java.util.List;
import java.util.concurrent.CopyOnWriteArrayList;
@Test
void viewCompleteSoloTree() {
List<SoloNode> soloList = new CopyOnWriteArrayList<>();
soloList.add(new SoloNode(1, PermissionLevelEnum.PERMISSION_MENU.getCode(),-1,
new PermissionResource("A网站运营菜单","/aWebsiteOperation","A网站运营帮助...","a-website-operation","svg")));
soloList.add(new SoloNode(2, PermissionLevelEnum.PERMISSION_MENU.getCode(),1,
new PermissionResource("A统计菜单","/statistics","统计帮助...","statistics","svg")));
soloList.add(new SoloNode(3, PermissionLevelEnum.FINE_GRIT_PERMISSION.getCode(),2,
new PermissionResource("A转换率统计权限","/conversionRate","转换率帮助...","conversion-rate","png")));
soloList.add(new SoloNode(4, PermissionLevelEnum.FINE_GRIT_PERMISSION.getCode(),2,
new PermissionResource("A曝光率统计权限","/exposureRate","曝光率帮助...","exposure-rate","png")));
soloList.add(new SoloNode(5, PermissionLevelEnum.PERMISSION_MENU.getCode(),-1,
new PermissionResource("资金总账管理菜单","/fundsManagement","资金总账帮助...","funds-management","svg")));
soloList.add(new SoloNode(6, PermissionLevelEnum.FINE_GRIT_PERMISSION.getCode(),5,
new PermissionResource("银行对账权限","/bankReconciliation","银行对账帮助...","bank-reconciliation","svg")));
List<SoloNode> soloTree = this.viewCompleteSoloTree(soloList);
System.out.println(JsonUtil.toJsonPretty(soloTree));
}
json输出如下
[ {
"id" : 1,
"permissionLevelEnum" : 1,
"parentId" : -1,
"permissionResource" : {
"name" : "A网站运营菜单",
"routePath" : "/aWebsiteOperation",
"helpDescription" : "A网站运营帮助...",
"iconName" : "a-website-operation",
"iconType" : "svg"
},
"children" : [ {
"id" : 2,
"permissionLevelEnum" : 1,
"parentId" : 1,
"permissionResource" : {
"name" : "A统计菜单",
"routePath" : "/statistics",
"helpDescription" : "统计帮助...",
"iconName" : "statistics",
"iconType" : "svg"
},
"children" : [ ]
} ]
}, {
"id" : 5,
"permissionLevelEnum" : 1,
"parentId" : -1,
"permissionResource" : {
"name" : "资金总账管理菜单",
"routePath" : "/fundsManagement",
"helpDescription" : "资金总账帮助...",
"iconName" : "funds-management",
"iconType" : "svg"
},
"children" : [ {
"id" : 6,
"permissionLevelEnum" : 2,
"parentId" : 5,
"permissionResource" : {
"name" : "银行对账权限",
"routePath" : "/bankReconciliation",
"helpDescription" : "银行对账帮助...",
"iconName" : "bank-reconciliation",
"iconType" : "svg"
},
"children" : [ ]
} ]
} ]
可以看到 Json中 A统计菜单下并没有A转换率统计权与A曝光率统计权, 说明这种方式只能查看到父子结构的单层树, 如果父节点下面还有父节点在没有标记属性的情况下就比较难以察觉, 因此只适合部分单层树业务, 我们可以对树结构与算法进行升级来达到兼容的目的.
@Data
public class SoloNode {
// 增加父节点标记属性
private Boolean areParent;
...
// 增加默认赋值
private List<SoloNode> children = new ArrayList<>(1);
}
public class SoloTreeCompleteSolution {
protected List<SoloNode> viewCompleteSoloTree(List<SoloNode> nodeList){
List<SoloNode> soloTreeList = new ArrayList<>();
for(SoloNode node : getRootNode(nodeList)) {
List<Integer> ids = new ArrayList<>();
this.buildParentIds(soloTreeList,ids);
SoloNode nodex = buildChilTree(node,nodeList,ids);
if (Boolean.FALSE.equals(ids.contains(nodex.getId()))){
soloTreeList.add(nodex);
}
}
return soloTreeList;
}
private List<SoloNode> getRootNode(List<SoloNode> nodeList) {
List<SoloNode> rootLists = new ArrayList<>();
for(SoloNode node : nodeList) {
if (Boolean.TRUE.equals(node.getAreParent())) {
rootLists.add(node);
}
}
return rootLists;
}
private void buildParentIds(List<SoloNode> nodeList, List<Integer> ids ){
for(SoloNode node : nodeList) {
if (Boolean.TRUE.equals(node.getAreParent())) {
ids.add(node.getId());
this.buildParentIds(node.getChildren(),ids);
}
}
}
}
最终输出
[ {
"id" : 1,
"permissionLevelEnum" : 1,
"parentId" : -1,
"areParent" : true,
"permissionResource" : {
"name" : "A网站运营菜单",
"routePath" : "/aWebsiteOperation",
"helpDescription" : "A网站运营帮助...",
"iconName" : "a-website-operation",
"iconType" : "svg"
},
"children" : [ {
"id" : 2,
"permissionLevelEnum" : 1,
"parentId" : 1,
"areParent" : true,
"permissionResource" : {
"name" : "A统计菜单",
"routePath" : "/statistics",
"helpDescription" : "统计帮助...",
"iconName" : "statistics",
"iconType" : "svg"
},
"children" : [ {
"id" : 3,
"permissionLevelEnum" : 2,
"parentId" : 2,
"areParent" : false,
"permissionResource" : {
"name" : "A转换率统计权限",
"routePath" : "/conversionRate",
"helpDescription" : "转换率帮助...",
"iconName" : "conversion-rate",
"iconType" : "png"
},
"children" : [ ]
}, {
"id" : 4,
"permissionLevelEnum" : 2,
"parentId" : 2,
"areParent" : false,
"permissionResource" : {
"name" : "A曝光率统计权限",
"routePath" : "/exposureRate",
"helpDescription" : "曝光率帮助...",
"iconName" : "exposure-rate",
"iconType" : "png"
},
"children" : [ ]
} ]
} ]
}, {
"id" : 5,
"permissionLevelEnum" : 1,
"parentId" : -1,
"areParent" : true,
"permissionResource" : {
"name" : "资金总账管理菜单",
"routePath" : "/fundsManagement",
"helpDescription" : "资金总账帮助...",
"iconName" : "funds-management",
"iconType" : "svg"
},
"children" : [ {
"id" : 6,
"permissionLevelEnum" : 2,
"parentId" : 5,
"areParent" : false,
"permissionResource" : {
"name" : "银行对账权限",
"routePath" : "/bankReconciliation",
"helpDescription" : "银行对账帮助...",
"iconName" : "bank-reconciliation",
"iconType" : "svg"
},
"children" : [ ]
} ]
} ]
通过标记父节点与build时剔除被构建过的子树, 这样多层的一对多树结构就完整的展示出来了, 但是这种实现方式比较蹩脚, 会进行一些无效计算, 影响性能, 下个例子会给出优化方法, 欢迎提 PR来优化.
https://github.com/XiaoZiShan/studey-advance/blob/e52a88fea306b066b2cc70335fb797d2468c791a/src/test/java/advance/datastructure/tree/SoloCompleteSolutionTest.java
多对多异形结构
在上个例子中可以看到我们用了递归来遍历树, 而中很多计算都是重复的，由于其本质是把一个问题分解成两个或者多个小问题，多个小问题存在相互重叠的部分，则存在重复计算，如用于生产则会因树的层级增多以及树的品种变多, 导致算法复杂度由 O(n) 变成 O(n!), 最终严重影响展示速度. 而在这个场景里递归只是为了感知子节点, 如果我们提前让子节点知道它有那些父节点, 情况会好很多. 那么下面来看看多对多的异形树应该如何环视吧 !
import lombok.AllArgsConstructor;
import lombok.Data;
import lombok.EqualsAndHashCode;
import studey.advance.datastructure.pojo.PermissionResource;
import java.util.ArrayList;
import java.util.List;
/**
* Created by 刷题使我快乐,自律使我自由 !
* 多对多用户-角色-权限树
*/
@Data
@AllArgsConstructor
public class MultNode {
private Integer id;
private String userName;
private List<RoleNode> roleNodes = new ArrayList<>();
@Data
public static class RoleNode{
private Integer id;
private String name;
private List<Integer> parentIds;
private Boolean areParent;
private List<PermissionNode> permissions = new ArrayList<>();
private List<RoleNode> children = new ArrayList<>();;
public RoleNode(Integer id, String name, List<Integer> parentIds, Boolean areParent, List<PermissionNode> permissions) {
this.id = id;
this.name = name;
this.parentIds = parentIds;
this.areParent = areParent;
this.permissions = permissions;
}
}
@Data
@EqualsAndHashCode(callSuper = true)
public static class PermissionNode extends SoloNode{
private List<Integer> parentIds;
public PermissionNode(List<Integer> parentIds, Integer id, Integer permissionLevelEnum, Integer parentId, Boolean areParent, PermissionResource permissionResource) {
super(id, permissionLevelEnum, parentId, areParent, permissionResource);
this.setParentIds(parentIds);
}
}
}
在环视时继承原先的单树算法. 比较两者的区别.
import studey.advance.datastructure.tree.MultNode;
import studey.advance.datastructure.tree.SoloNode;
import java.util.List;
public class MultTreeCompleteSolution extends SoloTreeCompleteSolution{
/**
* 当前仅供演示用的新BuildTree思路, 代码严谨性后续完善
* @param multNodes 未关联的多对多树
* @param roleNodes 角色树
* @param permissionNodes 权限树
* @return 已关联的多对多树
*/
protected List<MultNode> viewCompleteMultTree(List<MultNode> multNodes, List<MultNode.RoleNode> roleNodes , List<SoloNode> permissionNodes) {
for (MultNode nodeX : multNodes) {
// 遍历角色Tree (查询nodeX的角色节点并拼接组装)
for (MultNode.RoleNode roleX : nodeX.getRoleNodes()) {
for (MultNode.RoleNode roleY : roleNodes) {
if (roleY.getParentIds().contains(roleX.getId())) {
roleX.getChildren().add(roleY);
break;
}
}
// 用老的迭代树方式来递归权限树, 进行比较
for (MultNode.PermissionNode permissionX : roleX.getPermissions()){
List<SoloNode> soloNodes = this.viewCompleteSoloTree(permissionNodes);
for (SoloNode soloNodeY: soloNodes){
if (permissionX.getId().equals(soloNodeY.getId())){
permissionX.setChildren(soloNodeY.getChildren());
}
}
}
}
}
return multNodes;
}
}
单元测试数据在原先的基础上增加
import org.junit.jupiter.api.Test;
import studey.advance.datastructure.enums.PermissionLevelEnum;
import studey.advance.datastructure.pojo.PermissionResource;
import studey.advance.datastructure.tree.MultNode;
import studey.advance.datastructure.tree.SoloNode;
import studey.advance.datastructure.utils.JsonUtil;
import studey.advance.questiontypes.tree.MultTreeCompleteSolution;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
public class MultCompleteSolutionTest extends MultTreeCompleteSolution {
@Test
void viewCompleteSoloTree() {
List<SoloNode> permissionNodes = new ArrayList<>();
MultNode.PermissionNode aWwwOperation = new MultNode.PermissionNode(Collections.singletonList(-1),1, PermissionLevelEnum.PERMISSION_MENU.getCode(),-1,Boolean.TRUE,
new PermissionResource("A网站运营菜单","/aWebsiteOperation","A网站运营帮助...","a-website-operation","svg"));
permissionNodes.add(aWwwOperation);
permissionNodes.add(new MultNode.PermissionNode(Collections.unmodifiableList(Arrays.asList(-1,1)),2, PermissionLevelEnum.PERMISSION_MENU.getCode(),1,Boolean.TRUE,
new PermissionResource("A统计菜单","/statistics","统计帮助...","statistics","svg")));
permissionNodes.add(new MultNode.PermissionNode(Collections.unmodifiableList(Arrays.asList(-1,1,2)),3, PermissionLevelEnum.FINE_GRIT_PERMISSION.getCode(),2,Boolean.FALSE,
new PermissionResource("A转换率统计权限","/conversionRate","转换率帮助...","conversion-rate","png")));
permissionNodes.add(new MultNode.PermissionNode(Collections.unmodifiableList(Arrays.asList(-1,1,2)),4, PermissionLevelEnum.FINE_GRIT_PERMISSION.getCode(),2, Boolean.FALSE,
new PermissionResource("A曝光率统计权限","/exposureRate","曝光率帮助...","exposure-rate","png")));
MultNode.PermissionNode moneyGeneralLedger = new MultNode.PermissionNode(Collections.singletonList(-1),5, PermissionLevelEnum.PERMISSION_MENU.getCode(),-1,Boolean.TRUE,
new PermissionResource("资金总账管理菜单","/fundsManagement","资金总账帮助...","funds-management","svg"));
permissionNodes.add(moneyGeneralLedger);
permissionNodes.add(new MultNode.PermissionNode(Collections.unmodifiableList(Arrays.asList(-1,5)),6, PermissionLevelEnum.FINE_GRIT_PERMISSION.getCode(),5,Boolean.FALSE,
new PermissionResource("银行对账权限","/bankReconciliation","银行对账帮助...","bank-reconciliation","svg")));
List<MultNode.RoleNode> roleNodes = new ArrayList<>();
MultNode.RoleNode directorNetworkOperations = new MultNode.RoleNode(1,"全网运营总监", Collections.singletonList(-1),Boolean.TRUE, new ArrayList<>());
roleNodes.add(directorNetworkOperations);
MultNode.RoleNode roleNodex = new MultNode.RoleNode(2,"A网运营总监", Collections.singletonList(1),Boolean.TRUE, new ArrayList<>(Collections.singletonList(aWwwOperation)));
roleNodes.add(roleNodex);
MultNode.RoleNode chiefAccountantGeneraLedger = new MultNode.RoleNode(3,"总账首席会计师", Collections.singletonList(-1),Boolean.TRUE, new ArrayList<>(Collections.singletonList(moneyGeneralLedger)));
roleNodes.add(chiefAccountantGeneraLedger);
List<MultNode> multNodes = new ArrayList<>();
multNodes.add(new MultNode(1,"运营老李",Collections.singletonList(directorNetworkOperations)));
multNodes.add(new MultNode(1,"会计老张",Collections.singletonList(chiefAccountantGeneraLedger)));
List<MultNode> multTree = this.viewCompleteMultTree(multNodes,roleNodes,permissionNodes);
System.out.println(JsonUtil.toJsonPretty(multTree));
}
}
最终输出, 欢迎提PR优化
[ {
"id" : 1,
"userName" : "运营老李",
"roleNodes" : [ {
"id" : 1,
"name" : "全网运营总监",
"parentIds" : [ -1 ],
"areParent" : true,
"permissions" : [ ],
"children" : [ {
"id" : 2,
"name" : "A网运营总监",
"parentIds" : [ 1 ],
"areParent" : true,
"permissions" : [ {
"id" : 1,
"permissionLevelEnum" : 1,
"parentId" : -1,
"areParent" : true,
"permissionResource" : {
"name" : "A网站运营菜单",
"routePath" : "/aWebsiteOperation",
"helpDescription" : "A网站运营帮助...",
"iconName" : "a-website-operation",
"iconType" : "svg"
},
"children" : [ ],
"parentIds" : [ -1 ]
} ],
"children" : [ ]
} ]
} ]
}, {
"id" : 1,
"userName" : "会计老张",
"roleNodes" : [ {
"id" : 3,
"name" : "总账首席会计师",
"parentIds" : [ -1 ],
"areParent" : true,
"permissions" : [ {
"id" : 5,
"permissionLevelEnum" : 1,
"parentId" : -1,
"areParent" : true,
"permissionResource" : {
"name" : "资金总账管理菜单",
"routePath" : "/fundsManagement",
"helpDescription" : "资金总账帮助...",
"iconName" : "funds-management",
"iconType" : "svg"
},
"children" : [ {
"id" : 6,
"permissionLevelEnum" : 2,
"parentId" : 5,
"areParent" : false,
"permissionResource" : {
"name" : "银行对账权限",
"routePath" : "/bankReconciliation",
"helpDescription" : "银行对账帮助...",
"iconName" : "bank-reconciliation",
"iconType" : "svg"
},
"children" : [ ],
"parentIds" : [ -1, 5 ]
} ],
"parentIds" : [ -1 ]
} ],
"children" : [ ]
} ]
} ]
https://github.com/XiaoZiShan/studey-advance/blob/master/src/test/java/advance/datastructure/tree/MultCompleteSolutionTest.java
简洁回答以及总结
可以看到用维护父ids的方式可以替代部分递归树的场景, 提高运行效率. 以上代码只是demo, 还有很多边界问题以及可以优化的点, 比如用 减少无效计算, 用一个Map来代替一部分遍历工作, 抽象一个专门处理树形结构的工具类等等.
总之本文对一般的树形场景都涉及到了, 公司做业务的时候可以提前定义树形结构的写法, 开发新业务时只需要继承抽象对象然后调工具类即可. 这树形结构本身不复杂, 它不是我们常见的树结构. 比如红黑树, AVL树等, 而是一种为了展示而生拼装成的数据结构.
Tip
Mason 大神云淡风轻的说道: "大胖要加强基本功啊, 这个树只是非常简单的一种展示结构, 要是让你开发一款类似MySql的索引, 那你不是得上吊啊, 基础就像内裤, 平时不知道穿没穿, 关键的时候就容易掉链子 ! "
大胖红着脸说道: “这就去把王者农药卸载, 每天早睡早起, 以后咱们B站学习区见, 爷青回!”
我一声长叹道: “早知现在, 何必当初!”
山中问答 【朝代】 唐
问余何意栖碧山，笑而不答心自闲。
桃花流水窅然去，别有天地非人间。
扫码回复 “加群” 和我一起月入 20K+
深入浅出分享 Java 干货 , 找回对代码的 Passion , 助力月入 20K+
标签：时习,树结构,List,SoloNode,private,import,new,多线程,id 来源： https://blog.csdn.net/qq_37977176/article/details/115029463
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。