leetcode 128. Longest Consecutive Sequence C++

最新推荐文章于 2023-02-06 21:52:15 发布

暗日狂沙

最新推荐文章于 2023-02-06 21:52:15 发布

阅读量505

点赞数 1

分类专栏： leetcode 文章标签： leetcode 128 Longest Consecutive C++

本文链接：https://blog.csdn.net/yxl0011/article/details/53151334

版权

leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目地址：https://leetcode.com/problems/longest-consecutive-sequence/

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.

题目的要求是在数组中找到最长的连续元素序列，这一题解决方法很简单，先使用排序sort（nums.begin(),nums.end()）。然后计算连续的递增序列就好，该方法提交可击败98%玩家。代码如下：

class Solution {
	public:
		int longestConsecutive(vector<int>& nums) {
			sort(nums.begin(), nums.end());
			int count = 1;
			int max = 1;
			for (int i = 1; i < nums.size(); i++) {
			    if(nums[i] == nums[i - 1])
				    continue;
				if (nums[i] - nums[i - 1] == 1) {
					count++;
					if (count > max)
						max = count;
				}
				else
					count = 1;
			}
			return max;
		}
	};