2020年9月4日
[LeetCode] 462. Minimum Moves to Equal Array Elements II
摘要： Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment or 阅读全文
posted @ 2020-09-04 05:38 CNoodle 阅读(341) 评论(0) 推荐(0)
[LeetCode] 453. Minimum Moves to Equal Array Elements
摘要： Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment n 阅读全文
posted @ 2020-09-04 04:36 CNoodle 阅读(259) 评论(0) 推荐(0)