2017年9月2日
摘要: 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 @ 2017-09-02 20:13 无惧风云 阅读(121) 评论(0) 推荐(0) 编辑
摘要: Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requ 阅读全文
posted @ 2017-09-02 14:38 无惧风云 阅读(112) 评论(0) 推荐(0) 编辑
摘要: Given a string, sort it in decreasing order based on the frequency of characters. Example 1: Example 2: Example 3: 阅读全文
posted @ 2017-09-02 10:28 无惧风云 阅读(166) 评论(0) 推荐(0) 编辑
摘要: A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range [0, N - 1]. Sets S[K] for 0 <= K < N 阅读全文
posted @ 2017-09-02 09:41 无惧风云 阅读(186) 评论(0) 推荐(0) 编辑