leetcode-algorithms/src/MinimumCommonValue.java at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
// https://leetcode.com/problems/minimum-common-value
// T: O(m + n)
// S: O(1)

public class MinimumCommonValue {
    public int getCommon(int[] array1, int[] array2) {
        for (int i = 0, j = 0 ; i < array1.length && j < array2.length ; ) {
            if (array1[i] == array2[j]) return array1[i];

            if (array1[i] < array2[j]) {
                i++;
            } else {
                j++;
            }
        }
        return -1;
    }
}