func hasSub(p *TreeNode, c *TreeNode) bool {
	if c == nil { return true }
	if p == nil { return false }
       
	if p.Val != c.Val {
                 // 这个地方是不是应该改成 return false
		return true
	}

	return hasSub(p.Left, c.Left) && hasSub(p.Right, c.Right)
}

package problem003

import "testing"

func TestIsExist(t *testing.T) {
	type args struct {
		matrix [][]int
		number int
	}
	tests := []struct {
		name string
		args args
		want bool
	}{
		{name: "exist",
			args: args{
				matrix: [][]int{
					{1, 2, 8, 9},
					{2, 4, 9, 12},
					{4, 7, 10, 13},
					{6, 8, 11, 15},
				},
				number: 7,
			},
			want: true},
		{name: "notExist",
			args: args{
				matrix: [][]int{
					{1, 2, 8, 9},
					{2, 4, 9, 12},
					{4, 7, 10, 13},
					{6, 8, 11, 15},
				},
				number: 5,
			},
			want: false},
		{name: "empty",
			args: args{
				matrix: [][]int{},
				number: 7,
			},
			want: false},
		{name: "emptyRow",
			args: args{
				matrix: [][]int{{}},
				number: 7,
			},
			want: false},
	}
	for _, tt := range tests {
		t.Run(tt.name, func(t *testing.T) {
			if got := Find(tt.args.matrix, tt.args.number); got != tt.want {
				t.Errorf("IsExist() = %v, want %v", got, tt.want)
			}
		})
	}
}