algorithm

package

v0.0.0-...-a52c104 Latest Latest Go to latest Published: Aug 8, 2021 License: Apache-2.0 Imports: 1 Imported by: 0

Details

This section is empty.

This section is empty.

func LeftRightBound(nums []int) int

LeftRightBound 找左子树的右边界

func PrintLine(m [][]int, a, b, c, d int, upper bool)

func PrintMatrixZigZag(matrix [][]int)

PrintMatrixZigZag 旋转打印矩形

func Rotate(s [][]int) [][]int

Rotate 给一个正方形 N*N 矩阵, 求旋转之后的, 原地调整; no idea; T1: 顺时针旋转90度正方形, 原地调整

func RotateEdge(s [][]int, a, b, c, d int) [][]int

func TailTraverse(t *TreeNode)

TailTraverse 后续遍历

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func RecoverSearchTree(nums []int) *TreeNode

RecoverSearchTree 搜索二叉树给后序遍历的数组重归成搜索树返回头节点左-右-根字节面试题;