Introduction - If you have any usage issues, please Google them yourself
Given a non-0 component of the sequence of integers a1, a2, ..., an, the design of recursive algorithm for one by the same integer number consisting of the longest continuous segment (known as the longest consecutive number with the above) in length.