refactor 160

fishercoder1534 · fishercoder1534 · commit 8d100df83795 · 2021-10-24T11:26:50.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_160.java b/src/main/java/com/fishercoder/solutions/_160.java
@@ -8,7 +8,10 @@
 public class _160 {
 
     public static class Solution1 {
-
+        /**
+         * Time: O(max(m, n))
+         * Space: O(1)
+         */
         public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
             int lenA = findLen(headA);
             int lenB = findLen(headB);
@@ -45,7 +48,6 @@ private int findLen(ListNode head) {
     public static class Solution2 {
         /**
          * Most optimal solution:
-         * <p>
          * O(m+n) time
          * O(1) space
          * credit: https://discuss.leetcode.com/topic/28067/java-solution-without-knowing-the-difference-in-len
