Minimum Swaps To Make Sequences Increasing LeetCode solution in Java

1
class Solution {
2
  public int minSwap(int[] nums1, int[] nums2) {
3
    int p1 = nums1[0], p2 = nums2[0], ans = 0;
4
    int len = nums1.length, s = 0, count = 0;
5
    for (int i = 1; i < len; i++) {
6
      int n1 = nums1[i], n2 = nums2[i];
7
      if (n1 > p1 && n2 > p2) {
8
        if (n1 > p2 && n2 > p1) {
9
          ans += Math.min(count, i - s - count);
10
          s = i;
11
          count = 0;
12
        }
13
        p1 = n1;
14
        p2 = n2;
15
      } else {
16
        count++;
17
        p1 = n2;
18
        p2 = n1;
19
      }
20
    }
21
    return ans + Math.min(count, len - s - count);
22
  }
23
}