leetcode 1700. 无法吃午餐的学生数量 python

题目描述：

 

 题解：

对比students[0]和sandwiches[0]，如果相等，则分别pop(0)

如果students[0]和sandwiches[0]不相等，则将students[0]放入students最后，sandwiches[0]放入sandwiches最后。

直到students sandwiches为空或students[0]与sandwiches[0]不相等的次数等于students中元素数量。

class Solution(object):
    def countStudents(self, students, sandwiches):
        flag = 0
        while len(students)!=0:
            if students[0]==sandwiches[0]:
                students.pop(0)
                sandwiches.pop(0)
                flag = 0
            else:
                stu = students.pop(0)
                students.append(stu)
                flag = flag+1
                if flag==len(students):
                    return len(students)
        return 0