New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

腾讯面试题 #37

Open

into-piece opened this issue Dec 23, 2020 · 0 comments

Owner

into-piece commented Dec 23, 2020 •

edited

Loading

const arr = [101,19,12,51,32,7,103,8];

问题一：找出连续最大升序的数量

示例 1:
输入: [1,3,5,4,7]
输出: 3
解释: 最长连续递增序列是 [1,3,5], 长度为3。
尽管 [1,3,5,7] 也是升序的子序列, 但它不是连续的，因为5和7在原数组里被4隔开。

问题二：找出不连续最大升序的数量

The text was updated successfully, but these errors were encountered:

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment