you give positive integer array nums1 nums2 length nthe absolute sum difference array nums1 nums2 define sum nums1i nums2i 0 n 0indexedyou replace element nums1 element nums1 minimize absolute sum differencereturn minimum absolute sum difference replace element array nums1 since answer large return modulo 109 7x define asx x 0 orx x 0 example 1input nums1 175 nums2 235output 3explanation there possible optimal solution replace second element 175 115 replace second element 175 155both yield absolute sum difference 12 13 53 55 3example 2input nums1 246810 nums2 246810output 0explanation nums1 equal nums2 replacement need this result absolute sum difference 0example 3input nums1 1104427 nums2 935174output 20explanation replace element second 1104427 10104427this yield absolute sum difference 109 103 45 41 27 74 20 Constraintsn nums1lengthn nums2length1 n 1051 nums1i nums2i 105