Given a int array back to reverse the maximum continuous increasing of interval (at least more than equal to 2) arrays, and returns an array of maximum index should be the biggest of a given array index)

Input: 1,3,4,9,6,7 returns: 6, 7
Input: 1,3,4,1,2,3 returns: 1, 2, 3
Input: 1,3,4,2,4,7 returns: 2,4,7
Input: 1,8,4,5,6,7 returns: 4, 7
Input: 1,3,4,5,6,7 returns: 1,3,4,5,6,7

Input: 2,3,4,5,2,3,1 returns: null
Input: 2,3,4,5,1,2,3,1 returns: null
Input: 1,3,4,5,6,7,1 returns null

CodePudding user response:

Ha ha I silly didn't read the topic

CodePudding user response:

May be I can not express how accurate, look at the input and output

CodePudding user response:

The index is what?