128. Longest Consecutive Sequence Medium

1/**
2 * [128] Longest Consecutive Sequence
3 *
4 * Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
5 * You must write an algorithm that runs in O(n) time.
6 *  
7 * Example 1:
8 * 
9 * Input: nums = [100,4,200,1,3,2]
10 * Output: 4
11 * Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
12 * 
13 * Example 2:
14 * 
15 * Input: nums = [0,3,7,2,5,8,4,6,0,1]
16 * Output: 9
17 * 
18 *  
19 * Constraints:
20 * 
21 * 	0 <= nums.length <= 10^5
22 * 	-10^9 <= nums[i] <= 10^9
23 * 
24 */
25pub struct Solution {}
26
27// problem: https://leetcode.com/problems/longest-consecutive-sequence/
28// discuss: https://leetcode.com/problems/longest-consecutive-sequence/discuss/?currentPage=1&orderBy=most_votes&query=
29
30// submission codes start here
31
32impl Solution {
33    pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
34        0
35    }
36}
37
38// submission codes end
39
40#[cfg(test)]
41mod tests {
42    use super::*;
43
44    #[test]
45    fn test_128() {
46    }
47}
48