Commit 2eef0e1

ybian19azl397985856

authored and

committed

feat: 283.move-zeroes add Python3 implementation (azl397985856#142)

1 parent 6599c5e commit 2eef0e1Copy full SHA for 2eef0e1

File tree

1 file changed

+30

-9

lines changed

problems
- 283.move-zeroes.md

1 file changed

+30

-9

lines changed

`‎problems/283.move-zeroes.md‎`

Lines changed: 30 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,9 +31,11 @@ Minimize the total number of operations.`
`31`	`31`	`无`
`32`	`32`
`33`	`33`	`## 代码`
`34`		`-* 语言支持:JS,C++`
	`34`	`+`
	`35`	`+* 语言支持:JS, C++, Python`
`35`	`36`
`36`	`37`	`JavaScript Code:`
	`38`	`+`
`37`	`39`	```js
`38`	`40`	`/*`
`39`	`41`	`* @lc app=leetcode id=283 lang=javascript`
`@@ -50,19 +52,19 @@ JavaScript Code:`
`50`	`52`	`*`
`51`	`53`	`* Given an array nums, write a function to move all 0's to the end of it while`
`52`	`54`	`* maintaining the relative order of the non-zero elements.`
`53`		`- *`
	`55`	`+ *`
`54`	`56`	`* Example:`
`55`		`- *`
`56`		`- *`
	`57`	`+ *`
	`58`	`+ *`
`57`	`59`	`* Input: [0,1,0,3,12]`
`58`	`60`	`* Output: [1,3,12,0,0]`
`59`		`- *`
	`61`	`+ *`
`60`	`62`	`* Note:`
`61`		`- *`
`62`		`- *`
	`63`	`+ *`
	`64`	`+ *`
`63`	`65`	`* You must do this in-place without making a copy of the array.`
`64`	`66`	`* Minimize the total number of operations.`
`65`		`- *`
	`67`	`+ *`
`66`	`68`	`*/`
`67`	`69`	`/**`
`68`	`70`	`* @param {number[]} nums`
`@@ -82,9 +84,12 @@ var moveZeroes = function(nums) {`
`82`	`84`	`}`
`83`	`85`	`};`
`84`	`86`	```
	`87`	`+`
`85`	`88`	`C++ Code:`
	`89`	`+`
`86`	`90`	`> 解题思想与上面JavaScript一致,做了少许代码优化(非性能优化,因为时间复杂度都是O(n)):`
`87`	`91`	`> 增加一个游标来记录下一个待处理的元素的位置,这样只需要写一次循环即可。`
	`92`	`+`
`88`	`93`	```C++
`89`	`94`	`class Solution {`
`90`	`95`	`public:`
`@@ -101,7 +106,23 @@ public:`
`101`	`106`	`++nonZero;`
`102`	`107`	`}`
`103`	`108`	`++next;`
`104`		`- }`
	`109`	`+ }`
`105`	`110`	`}`
`106`	`111`	`};`
`107`	`112`	```
	`113`	`+`
	`114`	`+Python Code:`
	`115`	`+`
	`116`	+```python
	`117`	`+class Solution:`
	`118`	`+ def moveZeroes(self, nums: List[int]) -> None:`
	`119`	`+ """`
	`120`	`+ Do not return anything, modify nums in-place instead.`
	`121`	`+ """`
	`122`	`+ slow = fast = 0`
	`123`	`+ while fast < len(nums):`
	`124`	`+ if nums[fast] != 0:`
	`125`	`+ nums[fast], nums[slow] = nums[slow], nums[fast]`
	`126`	`+ slow += 1`
	`127`	`+ fast += 1`
	`128`	+```

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 2eef0e1

File tree

1 file changed

1 file changed

`‎problems/283.move-zeroes.md‎`

0 commit comments