- Published on
Max Consecutive Ones
- Authors
- Name
- ShoxruxC
- @iOSdasturchi
📝 Vazifa tavsifi
Sizga faqat 0 va 1 dan iborat ikkilik massiv nums berilgan. Uning ichidagi eng uzun ketma-ket 1 lar seriyasining uzunligini toping.
Misol:
Input: nums = [1,1,0,1,1,1]
Output: 3
Tushuntirish: Massivning birinchi va ikkinchi qismida ketma-ket uchta 1 bor.
Max Consecutive Ones
Oson10 daqiqa10 ball
📚 Misollar
Kiruvchi: nums = [1,1,0,1,1,1]
Chiquvchi: 3
Kiruvchi: nums = [1,0,1,1,0,1]
Chiquvchi: 2
func solve(_ nums: [Int]) -> Int {
// Kodingizni shu yerga yozing
return 0
}
Run tugmasini bosing