give an array and target value, find the max length of the subarray which sum of the elements is less or equal to that value. publicintlongestSubArray(int[] a,intk){if(a==null|| a.length==0){return0; }intmax=0;intlen=a.length;for(inti=0; i<len; i++){intstart=a[i];if(...
give an array and target value, find the max length of the subarray which sum of the elements is less or equal to that value. publicintlongestSubArray(int[] a,intk){if(a==null|| a.length==0){return0; }intmax=0;intlen=a.length;for(inti=0; i<len; i++){intstart=a[i];if(...