- Published on
Longest Consecutive Sequence
- Authors
- Name
- ShoxruxC
- @iOSdasturchi
📝 Vazifa tavsifi
Sizga tartiblanmagan butun sonlardan iborat nums massivi berilgan. Uning ichidan eng uzun ketma-ketlik hosil qiladigan elementlar ro'yxatining uzunligini toping.
Sizning yechimingiz O(n) vaqt murakkabligida ishlashi shart.
Misol:
Input: nums = [100,4,200,1,3,2]
Output: 4
Tushuntirish: Eng uzun ketma-ketlik bu [1, 2, 3, 4] bo'lib, uning uzunligi 4 ga teng.
Longest Consecutive Sequence
Qiyin35 daqiqa30 ball
📚 Misollar
Kiruvchi: nums = [100,4,200,1,3,2]
Chiquvchi: 4
Kiruvchi: nums = [0,3,7,2,5,8,4,6,0,1]
Chiquvchi: 9
func solve(_ nums: [Int]) -> Int {
// Kodingizni shu yerga yozing
return 0
}
Run tugmasini bosing