2021年4月25日
[LeetCode] 1837. Sum of Digits in Base K
摘要： Given an integer n (in base 10) and a base k, return the sum of the digits of n after converting n from base 10 to base k. After converting, each digi 阅读全文
posted @ 2021-04-25 15:10 CNoodle 阅读(195) 评论(0) 推荐(0)
[LeetCode] 410. Split Array Largest Sum
摘要： Given an array nums which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an 阅读全文
posted @ 2021-04-25 01:29 CNoodle 阅读(164) 评论(0) 推荐(0)