912 accepted. 868ms

Author: aQuaYi

Algorithms/0912.sort-an-array/README.md

@@ -0,0 +1,22 @@
+# [912. Sort an Array](https://leetcode.com/problems/sort-an-array/)
+
+Given an array of integers nums, sort the array in ascending order.
+
+Example 1:
+
+```text
+Input: [5,2,3,1]
+Output: [1,2,3,5]
+```
+
+Example 2:
+
+```text
+Input: [5,1,1,2,0,0]
+Output: [0,0,1,1,2,5]
+```
+
+Note:
+
+- 1 <= A.length <= 10000
+- -50000 <= A[i] <= 50000

Algorithms/0912.sort-an-array/sort-an-array.go

@@ -0,0 +1,8 @@
+package problem0912
+
+import "sort"
+
+func sortArray(nums []int) []int {
+	sort.Ints(nums)
+	return nums
+}

Algorithms/0912.sort-an-array/sort-an-array_test.go

@@ -0,0 +1,42 @@
+package problem0912
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	nums []int
+	ans  []int
+}{
+
+	{
+		[]int{5, 2, 3, 1},
+		[]int{1, 2, 3, 5},
+	},
+
+	{
+		[]int{5, 1, 1, 2, 0, 0},
+		[]int{0, 0, 1, 1, 2, 5},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_sortArray(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, sortArray(tc.nums), "输入:%v", tc)
+	}
+}
+
+func Benchmark_sortArray(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			sortArray(tc.nums)
+		}
+	}
+}

leetcode.json

@@ -1,22 +1,22 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 887,
-	"Updated": "2019-05-19T13:23:04.806650088+08:00",
+	"Updated": "2019-05-19T13:58:53.651574703+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 235,
 			"Total": 247
 		},
 		"Medium": {
-			"Solved": 376,
+			"Solved": 377,
 			"Total": 414
 		},
 		"Hard": {
 			"Solved": 165,
 			"Total": 177
 		},
 		"Total": {
-			"Solved": 776,
+			"Solved": 777,
 			"Total": 838
 		}
 	},
@@ -4659,7 +4659,7 @@
 			"TitleSlug": "lexicographical-numbers",
 			"PassRate": "45%",
 			"Difficulty": "Medium",
-			"IsAccepted": false,
+			"IsAccepted": true,
 			"IsPaid": false,
 			"IsFavor": false,
 			"IsNew": false,
@@ -10825,7 +10825,7 @@
 			"ID": 900,
 			"Title": "RLE Iterator",
 			"TitleSlug": "rle-iterator",
-			"PassRate": "49%",
+			"PassRate": "50%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11005,7 +11005,7 @@
 			"ID": 915,
 			"Title": "Partition Array into Disjoint Intervals",
 			"TitleSlug": "partition-array-into-disjoint-intervals",
-			"PassRate": "43%",
+			"PassRate": "42%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -12589,7 +12589,7 @@
 			"ID": 1047,
 			"Title": "Remove All Adjacent Duplicates In String",
 			"TitleSlug": "remove-all-adjacent-duplicates-in-string",
-			"PassRate": "54%",
+			"PassRate": "55%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -12601,7 +12601,7 @@
 			"ID": 1048,
 			"Title": "Longest String Chain",
 			"TitleSlug": "longest-string-chain",
-			"PassRate": "37%",
+			"PassRate": "38%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -12613,7 +12613,7 @@
 			"ID": 1049,
 			"Title": "Last Stone Weight II",
 			"TitleSlug": "last-stone-weight-ii",
-			"PassRate": "18%",
+			"PassRate": "19%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,