摘要: Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n  阅读全文
posted @ 2016-12-15 04:57 MiaBlog 阅读(388) 评论(0) 推荐(0) 编辑