Tushliksiz talabalar

package main


func (_ Solution) CountStudents(students []int, sandwiches []int) int {

  count := 0
  for len(sandwiches) != 0 {
    student := students[0]
    if students[0] == sandwiches[0] {
      students = students[1:]
      sandwiches = sandwiches[1:]
      count = 0
    } else {
      students = students[1:]
      students = append(students, student)
      count ++
     }

     if count == len(students) {
      break
     }
  }

  return len(students)
}

masala sharti bunday, oshxonada qator studentlar turibdi va ular 1 yoki 0 raqamli sandwinchlarni olishlari mumkin. Studentlarning tablari har xil, kimdir 1ni kimdir 0 ni yaxshi koradi.

Agar navbati kelgan student oziga mos sandwinchga togri kelib qolsa uni oladi va navbatdan ketadi yani sandwinchni olib ketadi. va agar studentga yoqmaydigani bolsa u qayta navbatga turadi student ozizga yoqqani topganicha )) orada nehcta student oziga olmaganini sanab ketishimiz kerak agar hech qaysi student ololmagan bolsa osha joyda break qilamiz yani 10 ta studentndan hech qaysi ololmagan bolsa 10 ta sendwinch qolgan bolsa qaytadan sorash foydasiz shuning uchun jarayonni tugatamiz.

hammasi OKEY bolsa, studentlarni sonini return qilamiz

Tushliksiz talabalar

Izohlar 0