Commit399814b

committed

linkedlist

1 parentf855c81 commit399814bCopy full SHA for 399814b

File tree

+49

-1

lines changed

+49

-1

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -289,7 +289,6 @@ public static void dfs3(String s, Set<String> dict,`
`289`	`289`	`/*`
`290`	`290`	`// 解法4：先用DP来求解某些字段是否能word break，然后再做`
`291`	`291`	`*/`
`292`		`-// 我们用DFS来解决这个问题吧`
`293`	`292`	`publicstaticList<String>wordBreak4(Strings,Set<String>dict) {`
`294`	`293`	`if (s ==null \|\|s.length() ==0 \|\|dict ==null) {`
`295`	`294`	`returnnull;`

Lines changed: 49 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,49 @@`
	`1`	`+packageAlgorithms.tree;`
	`2`	`+`
	`3`	`+importjava.util.LinkedList;`
	`4`	`+importjava.util.Queue;`
	`5`	`+`
	`6`	`+/**`
	`7`	`+ * Definition for binary tree with next pointer.`
	`8`	`+ * public class TreeLinkNode {`
	`9`	`+ * int val;`
	`10`	`+ * TreeLinkNode left, right, next;`
	`11`	`+ * TreeLinkNode(int x) { val = x; }`
	`12`	`+ * }`
	`13`	`+ */`
	`14`	`+publicclassConnect {`
	`15`	`+publicvoidconnect(TreeLinkNoderoot) {`
	`16`	`+if (root ==null) {`
	`17`	`+return;`
	`18`	`+ }`
	`19`	`+`
	`20`	`+TreeLinkNodedummy =newTreeLinkNode(0);`
	`21`	`+Queue<TreeLinkNode>q =newLinkedList<TreeLinkNode>();`
	`22`	`+q.offer(root);`
	`23`	`+q.offer(dummy);`
	`24`	`+`
	`25`	`+while (!q.isEmpty()) {`
	`26`	`+TreeLinkNodecur =q.poll();`
	`27`	`+if (cur ==dummy) {`
	`28`	`+if (!q.isEmpty()) {`
	`29`	`+q.offer(dummy);`
	`30`	`+ }`
	`31`	`+continue;`
	`32`	`+ }`
	`33`	`+`
	`34`	`+if (q.peek() ==dummy) {`
	`35`	`+cur.next =null;`
	`36`	`+ }else {`
	`37`	`+cur.next =q.peek();`
	`38`	`+ }`
	`39`	`+`
	`40`	`+if (cur.left !=null) {`
	`41`	`+q.offer(cur.left);`
	`42`	`+ }`
	`43`	`+`
	`44`	`+if (cur.right !=null) {`
	`45`	`+q.offer(cur.right);`
	`46`	`+ }`
	`47`	`+ }`
	`48`	`+ }`
	`49`	`+}`

Comments

(0)