Commit f386ffd

committed

ItemAssociation

1 parent fc02950 commit f386ffdCopy full SHA for f386ffd

File tree

+24

-0

lines changed

+24

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,11 @@`
`1`	`1`	`package leetcode2018;`
`2`	`2`
`3`	`3`	`import java.util.ArrayList;`
	`4`	`+import java.util.LinkedList;`
`4`	`5`	`import java.util.List;`
	`6`	`+import java.util.Queue;`
	`7`	`+`
	`8`	`+import amazon1.TreeNode;`
`5`	`9`
`6`	`10`	`public class Trees {`
`7`	`11`
`@@ -112,6 +116,26 @@ public TreeNode invertTree(TreeNode root) {`
`112`	`116`	`System.out.println("mid:"+root.val);`
`113`	`117`	`return root;`
`114`	`118`	`}`
	`119`	`+`
	`120`	`+ public List<List<Integer>> levelOrder(TreeNode root) {`
	`121`	`+ List<List<Integer>> re = new ArrayList<>();`
	`122`	`+ if(root==null) return re;`
	`123`	`+ Queue<TreeNode> q= new LinkedList<>();`
	`124`	`+ q.offer(root);`
	`125`	`+ while(!q.isEmpty()){`
	`126`	`+ List<Integer> level = new ArrayList<>();`
	`127`	`+ for(int i=0; i<q.size();i++){`
	`128`	`+ TreeNode c = q.poll();`
	`129`	`+ level.add(c.val);`
	`130`	`+ if(c.left!=null) q.offer(c.left);`
	`131`	`+ if(c.right!=null) q.offer(c.right);`
	`132`	`+ }`
	`133`	`+ re.add(level);`
	`134`	`+ }`
	`135`	`+ return re;`
	`136`	`+ }`
	`137`	`+`
	`138`	`+`
`115`	`139`
`116`	`140`	`}`
`117`	`141`

Comments

(0)