71 finish

Author: aQua

Algorithms/0071.simplify-path/simplify-path.go

@@ -9,17 +9,19 @@ func simplifyPath(path string) string {
 
 	for i := 0; i < lp; i++ {
 		// 使用前，清空 dir
+		// 这个方法比 dir = []byte{} 快了近 8 倍
 		dir = dir[:0]
-		// 截取 dir
+		// 获取 dir
 		for i < lp && path[i] != '/' {
 			dir = append(dir, path[i])
 			i++
 		}
 
 		s := string(dir)
+
 		switch s {
 		case ".", "":
-			continue
+			// do nothing
 		case "..":
 			if len(stack) > 0 {
 				// pop

Algorithms/0071.simplify-path/simplify-path_test.go

@@ -90,3 +90,18 @@ func Test_Problem0071(t *testing.T) {
 		ast.Equal(a.one, simplifyPath(p.path), "输入:%v", p)
 	}
 }
+
+func Benchmark_NewSlice(b *testing.B) {
+	dir := make([]byte, 0, 3)
+	dir = dir[:0]
+	for i := 0; i < b.N; i++ {
+		dir = []byte{}
+	}
+}
+
+func Benchmark_CutSlice(b *testing.B) {
+	dir := make([]byte, 0, 3)
+	for i := 0; i < b.N; i++ {
+		dir = dir[:0]
+	}
+}