2019年5月12日
453. Minimum Moves to Equal Array Elements
摘要： 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 @ 2019-05-12 22:07 Veritas_des_Liberty 阅读(201) 评论(0) 推荐(0)
423. Reconstruct Original Digits from English
摘要： Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order. Note: Example 1: Input 阅读全文
posted @ 2019-05-12 21:49 Veritas_des_Liberty 阅读(245) 评论(0) 推荐(0)