2022年5月31日
[LintCode] 183. Wood Cut
摘要： Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the s 阅读全文
posted @ 2022-05-31 07:47 CNoodle 阅读(519) 评论(0) 推荐(0) 编辑