feat: commit solution 283

Author: lxlxw

_sidebar.md

@@ -25,6 +25,7 @@
   - [169.多数元素](solution/100-199/0169.majority-element/)
   - [217.存在重复元素](solution/200-299/0217.contains-duplicate/)
   - [219.存在重复元素 II](solution/200-299/0219.contains-duplicate-ii/)
+  - [283.移动零](solution/200-299/0283.move-zeroes/)
 
 
 

index-tags.md

@@ -30,9 +30,10 @@
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [66](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/1-99/0066.plus-one/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
+|  [169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/100-199/0169.majority-element/)  |  `位运算`,`数组`,`分治算法`  |  <font color=green>简单</font>  |✅ |
 |  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
-|  [169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/100-199/0169.majority-element/)  |  `位运算`,`数组`,`分治算法`  |  <font color=green>简单</font>  |✅ |
+|  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 
 #### **哈希表**
 
@@ -59,7 +60,7 @@
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
-
+|  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 
 #### **链表**
 

index-type.md

@@ -91,7 +91,7 @@
 |  [270](https://leetcode-cn.com/problems/closest-binary-search-tree-value)  |  [最接近的二叉搜索树值](/solution/200-299/0270.closest-binary-search-tree-value/)  |  `树`,`二分查找`  |  <font color=green>简单</font>  |
 |  [276](https://leetcode-cn.com/problems/paint-fence)  |  [栅栏涂色](/solution/200-299/0276.paint-fence/)  |  `动态规划`  |  <font color=green>简单</font>  |
 |  [278](https://leetcode-cn.com/problems/first-bad-version)  |  [第一个错误的版本](/solution/200-299/0278.first-bad-version/)  |  `二分查找`  |  <font color=green>简单</font>  |
-|  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |
+|  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [290](https://leetcode-cn.com/problems/word-pattern)  |  [单词规律](/solution/200-299/0290.word-pattern/)  |  `哈希表`  |  <font color=green>简单</font>  |
 |  [292](https://leetcode-cn.com/problems/nim-game)  |  [nim 游戏](/solution/200-299/0292.nim-game/)  |  `脑筋急转弯`,`极小化极大`  |  <font color=green>简单</font>  |
 |  [293](https://leetcode-cn.com/problems/flip-game)  |  [翻转游戏](/solution/200-299/0293.flip-game/)  |  `字符串`  |  <font color=green>简单</font>  |

solution/200-299/0283.move-zeroes/README.md

@@ -0,0 +1,47 @@
+# [283.移动零](https://leetcode-cn.com/problems/move-zeroes/description/)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给定一个数组 <code>nums</code>，编写一个函数将所有 <code>0</code> 移动到数组的末尾，同时保持非零元素的相对顺序。</p>
+
+<p><strong>示例:</strong></p>
+
+<pre><strong>输入:</strong> <code>[0,1,0,3,12]</code>
+<strong>输出:</strong> <code>[1,3,12,0,0]</code></pre>
+
+<p><strong>说明</strong>:</p>
+
+<ol>
+	<li>必须在原数组上操作，不能拷贝额外的数组。</li>
+	<li>尽量减少操作次数。</li>
+</ol>
+</div>
+
+
+### 解题思路
+
+![](http://lc-photo.xwlin.com/283.gif)
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func moveZeroes(nums []int) {
+	p := 0
+	for i := 0; i < len(nums); i++ {
+		if nums[i] != 0 {
+			nums[p] = nums[i]
+			if p != i {
+				nums[i] = 0
+			}
+			p++
+		}
+	}
+}
+```
+
+
+<!-- tabs:end -->

solution/200-299/0283.move-zeroes/solution.go

@@ -0,0 +1,23 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=283 lang=golang
+ *
+ * [283] 移动零
+ */
+
+// @lc code=start
+func moveZeroes(nums []int) {
+	p := 0
+	for i := 0; i < len(nums); i++ {
+		if nums[i] != 0 {
+			nums[p] = nums[i]
+			if p != i {
+				nums[i] = 0
+			}
+			p++
+		}
+	}
+}
+
+// @lc code=end

solution/200-299/0283.move-zeroes/solution_test.go

@@ -0,0 +1,19 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestMoveZeroes(t *testing.T) {
+	var nums []int
+	var ret []int
+
+	nums = []int{0, 1, 0, 3, 12}
+	ret = []int{1, 3, 12, 0, 0}
+	moveZeroes(nums)
+	for k, v := range nums {
+		if v != ret[k] {
+			t.Fatalf("case fails: %v\n", ret)
+		}
+	}
+}