摘要: 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 @ 2017-03-04 14:45 __Meng 阅读(173) 评论(0) 推荐(0) 编辑