Commit8d100df

committed

refactor 160

1 parentd772b0e commit8d100dfCopy full SHA for 8d100df

File tree

-2

lines changed

-2

lines changed

Lines changed: 4 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,10 @@`
`8`	`8`	`publicclass_160 {`
`9`	`9`
`10`	`10`	`publicstaticclassSolution1 {`
`11`		`-`
	`11`	`+/**`
	`12`	`+ * Time: O(max(m, n))`
	`13`	`+ * Space: O(1)`
	`14`	`+ */`
`12`	`15`	`publicListNodegetIntersectionNode(ListNodeheadA,ListNodeheadB) {`
`13`	`16`	`intlenA =findLen(headA);`
`14`	`17`	`intlenB =findLen(headB);`
`@@ -45,7 +48,6 @@ private int findLen(ListNode head) {`
`45`	`48`	`publicstaticclassSolution2 {`
`46`	`49`	`/**`
`47`	`50`	`* Most optimal solution:`
`48`		`- * <p>`
`49`	`51`	`* O(m+n) time`
`50`	`52`	`* O(1) space`
`51`	`53`	`* credit: https://discuss.leetcode.com/topic/28067/java-solution-without-knowing-the-difference-in-len`

Comments

(0)