leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1855.cpp (384B)

0 class Solution { 1 public: 2 int maxDistance(const vector<int> &nums1, const vector<int> &nums2) const { 3 const int n = size(nums1), m = size(nums2); 4 int res = 0, i = 0, j = 0; 5 6 while (i < n && j < m) { 7 if (nums1[i] > nums2[j]) 8 i++; 9 else 10 res = max(res, j++ - i); 11 } 12 13 return res; 14 } 15 };