To the Top
File:  root - text - article - 2019 - 11 - moving-zeros.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1075 Views, 19273 Search Bots | 103 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:

By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

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.

Example:
Input: [0,1,0,3,12]
Output: [1,3,12,0,0]
You must do this in-place without making a copy of the array.
Minimize the total number of operations.

Here is a starting point:


class Solution:
def moveZeros(self, nums):
# Fill this in.

nums = [0, 0, 0, 2, 0, 1, 3, 4, 0, 0]
Solution().moveZeros(nums)
print(nums)
# [2, 1, 3, 4, 0, 0, 0, 0, 0, 0]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1075 Views, 19273 Search Bots | 103 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Arithmetic Binary Tree
  2. Daily Interview Problem: Look and Say Sequence
  3. Daily Interview Problem: Largest Product of 3 Elements I
  4. Fibonacci coding
  5. [Daily Problem] Angles of a Clock
  6. Batch Programming in XP
  7. Plus One
  8. Absolute Path
  9. PHP Unit Tests on VPS Server
  10. Daily Interview Problem: Merge Overlapping Intervals

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />