- 博客(2)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 453. Minimum Moves to Equal Array Elements（unsolved）
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 - 1 elements by 1.Example:Input: [1,2,3]Output: 3
2017-05-31 21:29:31
288
原创 283. Move Zeroes
Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your funct
2017-05-31 15:05:32
184
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人