leetcode

0 class Solution {

1 public:

2 int getCommon(const vector<int> &nums1, const vector<int> &nums2) const {

3 const int n = size(nums1), m = size(nums2);

4

5 int i = 0, j = 0;

6 while (i < n && j < m) {

7 if (nums1[i] == nums2[j]) return nums1[i];

8 if (nums1[i] > nums2[j])

9 j++;

10 else

11 i++;

12 }

13

14 return -1;

15 }

16 };