业务场景:
一个机构查询科室信息的时候,希望返回树状结构的嵌套格式;
解决办法:
通过递归和指针,嵌套成对应的结构体;
借鉴了前人的代码,但是最后递归的指针调用自己也是调试了半天才出来,这里献上完整的示例代码.
package main import ( "fmt" "encoding/json" ) type dept struct { DeptId string `json:"deptId"` FrameDeptStr string `json:"frameDeptStr"` Child []*dept `json:"child"` } func main() { depts := make([]dept,0) var a dept a.DeptId = "1" a.FrameDeptStr = "" depts = append(depts,a) a.DeptId="3" a.FrameDeptStr = "1" depts = append(depts,a) a.DeptId="4" a.FrameDeptStr = "1" depts = append(depts,a) a.DeptId="5" a.FrameDeptStr = "13" depts = append(depts,a) a.DeptId="6" a.FrameDeptStr = "13" depts = append(depts,a) fmt.Println(depts) deptRoots := make([]dept,0) for _,v := range depts{ if v.FrameDeptStr == ""{ deptRoots= append(deptRoots,v) } } pdepts := make([]*dept,0) for i,_ := range depts{ var a *dept a = &depts[i] pdepts = append(pdepts,a) } //获取了根上的科室 fmt.Println("根上的科室有:",deptRoots) var node *dept node = &depts[0] makeTree(pdepts,node) fmt.Println("the result we got is",pdepts) data, _ := json.Marshal(node) fmt.Printf("%s", data) } func has(v1 dept,vs []*dept) bool { var has bool has = false for _,v2 := range vs { v3 := *v2 if v1.FrameDeptStr+v1.DeptId == v3.FrameDeptStr{ has = true break } } return has } func makeTree(vs []*dept,node *dept) { fmt.Println("the node value in maketree is:",*node) childs := findChild(node,vs) fmt.Println(" the child we got is :",childs) for _,child := range childs{ fmt.Println("in the childs's for loop, the child's address here is:",&child) node.Child = append(node.Child,child) fmt.Println("in the child's for loop, after append the child is:",child) if has(*child,vs) { fmt.Println("i am in if has") fmt.Println("the child in if has is:",*child) fmt.Println("the child in if has 's address is:",child) makeTree(vs,child) } } } func findChild(v *dept,vs []*dept)(ret []*dept) { for _,v2 := range vs{ if v.FrameDeptStr+v.DeptId == v2.FrameDeptStr{ ret= append(ret,v2) } } return }
代码备注: 通过frame_dept_str来确定科室之间的关系的, (a.frame_dept_str= a's parent's frame_dept_str + a's parent's dept_id).
