2021年12月1日
[LeetCode] 1262. Greatest Sum Divisible by Three 可被三整除的最大和
摘要： Given an array nums of integers, we need to find the maximum possible sum of elements of the array such that it is divisible by three. Example 1: Inpu 阅读全文
posted @ 2021-12-01 14:42 Grandyang 阅读(753) 评论(0) 推荐(0) 编辑
Fork me on GitHub