<p>Given two integer arrays <code>nums1</code> and <code>nums2</code>, return <em>the maximum length of a subarray that appears in <strong>both</strong> arrays</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The repeated subarray with maximum length is [3,2,1].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
<strong>Output:</strong> 5
<strong>Explanation:</strong> The repeated subarray with maximum length is [0,0,0,0,0].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 100</code></li>
</ul>

class Solution {
public:
    int findLength(vector<int>& nums1, vector<int>& nums2) {
        int lwr = 0, upr = min(nums1.size(), nums2.size()) + 1;
        while (lwr < upr) {
            int mid = (lwr + upr) / 2;
            cout << mid << endl;
            if (check(mid, nums1, nums2)) {
                // we can increase
                cout << "worked" << endl;
                lwr = mid+1;
            }
            else {
                cout << "didn't" << endl;
                upr = mid;
            }
        }
        return lwr - 1;
    }

    bool check(int l, vector<int> nums1, vector<int> nums2) {
        // check each subarray of length l
        int start = 0;
        while (start <= nums1.size() -  l) {
            int ind = 0;
            while (ind <= nums2.size() - l) {
                int inc = 0;
                while (inc < l && nums1[start + inc] == nums2[ind + inc]) inc++;
                if (inc == l) {
                    // match found
                    return true;
                }
                // match not found
                ind++;
            }
            start++;
        }
        return false;
    }
};
15553