Leetcode题目解析(191016)
Leetcode 572:另一个树的子树 题目描述 给定两个非空二叉树 s 和 t,检验 s 中是否包含和 t […]
[leetcode]题目解析(190524)
valid sudoku 题目描述 Determine if a Sudoku is valid, accor […]
[Leetcode]merge sorted array
merge sorted array 题目描述 Given two sorted integer arrays […]
[leetcode]populating next right pointers in each node
题目描述 题目描述 Given a binary tree struct TreeLinkNode { Tre […]
[Leetcode]copy list with random pointer
题目描述 A linked list is given such that each node contain […]
leetcode之single-number-ii、Gas station、word break
single-number-ii Given an array of integers, every elem […]
算法笔记之线性规划网络流问题(5)
最大收益问题 问题分析 经过分析,又根据最大流最小割定理,最大流的流值等于最小割容量。即:实验方案净收益=所有 […]