Find the largest Bitonic sub array in a array


  • 0
    S

    Find the largest Bitonic sub array in a array


  • 0

    The solution is to run LIS (Longest Increasing Subarray) from left to right and LDS (Longest Decreasing Subarray) from right to left, then sum up for each position and find out the largest value. For detailed solution, take a look at this post.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.