LeetCode 1894.找到需要补充粉笔的学生编号

最新推荐文章于 2024-06-22 22:59:06 发布

生信研究猿

最新推荐文章于 2024-06-22 22:59:06 发布

阅读量137

点赞数

分类专栏： LeetCode刷题文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/m0_65188455/article/details/126143066

版权

LeetCode刷题专栏收录该内容

37 篇文章 0 订阅

订阅专栏

python

class Solution:
    def chalkReplacer(self, chalk: List[int], k: int) -> int:
        
        sum_chalk = 0
        for i in range(len(chalk)):
            sum_chalk += chalk[i]
        
        if(k>sum_chalk):
            k = k%sum_chalk
        
        i = 0
        while(1):
            k -= chalk[i%len(chalk)]
            # print(k)
            if(k<0):
                break
            i +=1
        return  i%len(chalk)