820 added

Author: aQua

Algorithms/0820.short-encoding-of-words/README.md

@@ -0,0 +1,29 @@
+# [820. Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)
+
+## 题目
+
+Given a list of words, we may encode it by writing a reference string S and a list of indexes A.
+
+For example, if the list of words is ["time", "me", "bell"], we can write it as S = "time#bell#"and indexes = [0, 2, 5].
+
+Then for each index, we will recover the word by reading from the reference string from that index until we reach a "#" character.
+
+What is the length of the shortest reference string S possible that encodes the given words?
+
+Example:
+
+```text
+Input: words = ["time", "me", "bell"]
+Output: 10
+Explanation: S = "time#bell#" and indexes = [0, 2, 5].
+```
+
+Note:
+
+1. 1 <= words.length<= 2000.
+1. 1 <=words[i].length<= 7.
+1. Each wordhas onlylowercase letters.
+
+## 解题思路
+
+见程序注释

Algorithms/0820.short-encoding-of-words/short-encoding-of-words.go

@@ -0,0 +1,6 @@
+package problem0820
+
+func minimumLengthEncoding(words []string) int {
+    
+	return 0
+}

Algorithms/0820.short-encoding-of-words/short-encoding-of-words_test.go

@@ -0,0 +1,36 @@
+package problem0820
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	words []string
+	ans int
+}{
+
+
+	
+	// 可以有多个 testcase
+}
+
+func Test_minimumLengthEncoding(t *testing.T) {
+	ast := assert.New(t)
+	
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, minimumLengthEncoding(tc.words), "输入:%v", tc)
+	}
+}
+
+func Benchmark_minimumLengthEncoding(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			minimumLengthEncoding(tc.words)
+		}
+	}
+}

leetcode.json

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 1144,
-	"Updated": "2018-05-16T09:48:26.298742405+08:00",
+	"Updated": "2018-05-16T09:51:31.24856088+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 167,
@@ -9529,7 +9529,7 @@
 			"ID": 792,
 			"Title": "Number of Matching Subsequences",
 			"TitleSlug": "number-of-matching-subsequences",
-			"PassRate": "35%",
+			"PassRate": "36%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,