摘要: Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected e 阅读全文
posted @ 2016-12-21 19:00 Black_Knight 阅读(277) 评论(0) 推荐(0) 编辑
摘要: The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Now your job is to find the total 阅读全文
posted @ 2016-12-21 10:50 Black_Knight 阅读(1412) 评论(0) 推荐(0) 编辑