Update zeros_at_the_end.py

coder9051 · web-flow · commit 84debe4ab520 · 2022-03-05T01:08:30.000+05:30
diff --git a/zeros_at_the_end.py b/zeros_at_the_end.py
@@ -1,12 +1,6 @@
 # -*- coding: utf-8 -*-
-"""Zeros_at the end.ipynb
-
-Automatically generated by Colaboratory.
-
-Original file is located at
-    https://colab.research.google.com/drive/1UQ9TjradMeWthUYJrSAjRBG5pWJiFhtR
-
-**Move all zeros present in an array to the end**
+"""
+                                       **Move all zeros present in an array to the end**
 
 Q. Given an integer array, move all zeros present on it to the end. The solution should maintain the relative order of items in the 
 array and should not use constant space.
@@ -41,13 +35,11 @@ def shiftAllZerosToEnd(arr):
 shiftAllZerosToEnd(arr)
 print(arr)
 
-"""SOLUTION 2: Coders trick
-
+"""
+SOLUTION 2: Coders trick
 First we count number of zeros then we iterate through array and remove all the zeros and append zeros at the end of array for every zeros removed.
-
 Time complexity of this solution is greater then O(n) but no extra space is required.
 
-
 """
 
 arr = [1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0, 9]
@@ -57,11 +49,12 @@ def shiftAllZerosToEnd(arr):
   arr.append(0)
 print(arr)
 
-"""SOLUTION 3: Mathematical Coder!
+"""
+SOLUTION 3: Mathematical Coder!
 Sort the array by setting key to bool and reverse is true. In python the value of true is 1 and false is 0. When there is any number except 0 it returns true and false for zero.
 Time complexity of this solution is greater then O(nlogn) but no extra space is required.
 """
 
 arr = [1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0, 9]
 arr.sort(key = bool, reverse = True)
-print(arr)
+print(arr)
