Commit fb3bd9b

committed

LC#142 added brute force approach- find first meet point in linkedlist cycle

1 parent c804312 commit fb3bd9bCopy full SHA for fb3bd9b

File tree

+19

-0

lines changed

+19

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,8 @@`
`1`	`1`	`package LinkedList;`
`2`	`2`
	`3`	`+import java.util.HashMap;`
	`4`	`+import java.util.Map;`
	`5`	`+`
`3`	`6`	`public class LinkedListCycleII142 {`
`4`	`7`
`5`	`8`	`class ListNode {`
`@@ -12,6 +15,22 @@ class ListNode {`
`12`	`15`	`}`
`13`	`16`	`}`
`14`	`17`
	`18`	`+ // brute force way`
	`19`	`+ public ListNode detectCycleII(ListNode head) {`
	`20`	`+ if (head == null \|\| head.next == null)`
	`21`	`+ return null;`
	`22`	`+`
	`23`	`+ Map<ListNode, Boolean> map = new HashMap<>();`
	`24`	`+`
	`25`	`+ ListNode start = head;`
	`26`	`+ while (start != null && !map.containsKey(start)) {`
	`27`	`+ map.put(start, true);`
	`28`	`+ start = start.next;`
	`29`	`+ }`
	`30`	`+`
	`31`	`+ return start;`
	`32`	`+ }`
	`33`	`+`
`15`	`34`	`public ListNode detectCycle(ListNode head) {`
`16`	`35`
`17`	`36`	`if (head == null \|\| head.next == null)`

Comments

(0)