329 added

Author: aQua

Algorithms/0329.longest-increasing-path-in-a-matrix/README.md

@@ -0,0 +1,37 @@
+# [329. Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)
+
+## 题目
+
+Given an integer matrix, find the length of the longest increasing path.
+
+From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).
+
+Example 1:
+
+```text
+nums = [
+  [9,9,4],
+  [6,6,8],
+  [2,1,1]
+]
+Return 4
+The longest increasing path is [1, 2, 6, 9].
+```
+
+Example 2:
+
+```text
+nums = [
+  [3,4,5],
+  [3,2,6],
+  [2,2,1]
+]
+Return 4
+The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.
+```
+
+Credits:Special thanks to @dietpepsi for adding this problem and creating all test cases.
+
+## 解题思路
+
+见程序注释

Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.go

@@ -0,0 +1,6 @@
+package Problem0329
+
+func longestIncreasingPath(matrix [][]int) int {
+
+	return 4
+}

Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go

@@ -0,0 +1,48 @@
+package Problem0329
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	matrix [][]int
+	ans    int
+}{
+
+	{[][]int{
+		[]int{9, 9, 4},
+		[]int{6, 6, 8},
+		[]int{2, 1, 1},
+	},
+		4},
+
+	{[][]int{
+		[]int{3, 4, 5},
+		[]int{3, 2, 6},
+		[]int{2, 2, 1},
+	},
+		4},
+
+	// 可以有多个 testcase
+}
+
+func Test_longestIncreasingPath(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, longestIncreasingPath(tc.matrix), "输入:%v", tc)
+	}
+}
+
+func Benchmark_longestIncreasingPath(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			longestIncreasingPath(tc.matrix)
+		}
+	}
+}