leetcode718_最长公共子数组

class Solution {
    public int findLength(int[] nums1, int[] nums2) {
        int ans = 0, len1 = nums1.length, len2 = nums2.length;
        for(int i = 0; i < len1; i++) {
            int l1 = i, l2 = 0;
            while (l2 < len2) {
                int len = 0;
                while(l2 < len2 && nums2[l2] != nums1[l1]  ) ++l2;
                //while(nums1[])
                while (l1 + len < len1 && l2 + len < len2 && nums1[l1+len] == nums2[l2+len]) {
                    ++len;
                }
                ans = Math.max(len, ans);
                ++l2;
            }
        }
        return ans;
    }
}