2019年12月11日
【leetcode】1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
摘要： 题目如下： Given a m x n binary matrix mat. In one step, you can choose one cell and flip it and all the four neighbours of it if they exist (Flip is chang 阅读全文
posted @ 2019-12-11 22:37 seyjs 阅读(471) 评论(0) 推荐(0)
【leetcode】1283. Find the Smallest Divisor Given a Threshold
摘要： 题目如下： Given an array of integers nums and an integer threshold, we will choose a positive integer divisor and divide all the array by it and sum the r 阅读全文
posted @ 2019-12-11 22:35 seyjs 阅读(523) 评论(0) 推荐(0)
【leetcode】1282. Group the People Given the Group Size They Belong To
摘要： 题目如下： There are n people whose IDs go from 0 to n - 1 and each person belongs exactly to one group. Given the array groupSizes of length n telling the 阅读全文
posted @ 2019-12-11 22:28 seyjs 阅读(464) 评论(0) 推荐(0)
【leetcode】1281. Subtract the Product and Sum of Digits of an Integer
摘要： 题目如下： Given an integer number n, return the difference between the product of its digits and the sum of its digits. Example 1: Input: n = 234 Output: 阅读全文
posted @ 2019-12-11 22:26 seyjs 阅读(450) 评论(0) 推荐(0)