LeetCode OJ 系列之283 Move Zeroes --Python
来源:互联网 发布:木工柜门半盖怎么算法 编辑:程序博客网 时间:2024/05/22 10:40
Problem:
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 function, nums
should be [1, 3, 12, 0, 0]
.
Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
Answer:
class Solution(object): def moveZeroes(self, nums): """ :type nums: List[int] :rtype: void Do not return anything, modify nums in-place instead. """ oldlen = len(nums) tmplist = filter(lambda x:x !=0,nums) del nums[:] for i in range(oldlen): if i< len(tmplist): nums.append(tmplist[i]) else: nums.append(0)
0 0
- LeetCode OJ 系列之283 Move Zeroes --Python
- LeetCode OJ 系列之73 Set Matrix Zeroes --Python
- <LeetCode OJ> 283. Move Zeroes
- LeetCode OJ-283. Move Zeroes
- leetcode之Move Zeroes
- leetcode 283: Move Zeroes
- leetcode-283-Move Zeroes
- [leetcode 283]Move Zeroes
- LeetCode 283----Move Zeroes
- Leetcode #283 Move Zeroes
- leetcode: (283) Move Zeroes
- [LeetCode 283] Move Zeroes
- Leetcode 283 Move Zeroes
- leetcode 283--Move Zeroes
- LeetCode-----283Move Zeroes
- 【LEETCODE】283-Move Zeroes
- 【LeetCode】283Move Zeroes
- Leetcode #283 Move Zeroes
- 股票投资
- swift之函数(functions)
- POJ1251 Jungle Roads(kru)
- Ⅰ.2.4 如何使用Qt Convenience API
- IOS开发之TabBarItem&NavigationBarItem
- LeetCode OJ 系列之283 Move Zeroes --Python
- Ⅰ.2.5 如何使用Qt Signal Handles
- Android 多线程处理之多线程用法大集合
- C# Eval
- Cocos2D:塔防游戏制作之旅(十一)
- Google Java编程风格指南
- 黑马程序员——网络编程(二)
- 实例讲解如何利用jQuery设置图片居中放大或者缩小
- 凸优化--强弱对偶性的几何解释