Golang每日一练(leetDay0079) 最大正方形、完全二叉树节点数
目录
222. 完全二叉树的节点个数 Count Complete Tree Nodes 🌟🌟
221. 最大正方形 Maximal Square
在一个由 '0'
和 '1'
组成的二维矩阵内,找到只包含 '1'
的最大正方形,并返回其面积。
示例 1:
输入:matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
输出:4
示例 2:
输入:matrix = [["0","1"],["1","0"]]
输出:1
示例 3:
输入:matrix = [["0"]]
输出:0
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 300
matrix[i][j]
为'0'
或'1'
代码1: 暴力枚举
-
package main
-
-
import (
-
"fmt"
-
)
-
-
func maximalSquare(matrix [][]byte) int {
-
m, n := len(matrix), len(matrix[0])
-
maxLen := 0
-
for i := 0; i < m; i {
-
for j := 0; j < n; j {
-
if matrix[i][j] == '1' {
-
curLen := 1
-
flag := true
-
for k := 1; k i < m && k j < n && flag; k {
-
for l := 0; l <= k; l {
-
if matrix[i k][j l] == '0' || matrix[i l][j k] == '0' {
-
flag = false
-
break
-
}
-
}
-
if flag {
-
curLen
-
}
-
}
-
if curLen > maxLen {
-
maxLen = curLen
-
}
-
}
-
}
-
}
-
return maxLen * maxLen
-
}
-
-
func main() {
-
matrix := [][]byte{{'1', '0', '1', '0', '0'}, {'1', '0', '1', '1', '1'}, {'1', '1', '1', '1', '1'}, {'1', '0', '0', '1', '0'}}
-
fmt.Println(maximalSquare(matrix))
-
matrix = [][]byte{{'0', '1'}, {'1', '0'}}
-
fmt.Println(maximalSquare(matrix))
-
matrix = [][]byte{{'0'}}
-
fmt.Println(maximalSquare(matrix))
-
}
代码2: 动态规划
-
package main
-
-
import (
-
"fmt"
-
)
-
-
func maximalSquare(matrix [][]byte) int {
-
m, n := len(matrix), len(matrix[0])
-
maxLen := 0
-
dp := make([][]int, m)
-
for i := 0; i < m; i {
-
dp[i] = make([]int, n)
-
for j := 0; j < n; j {
-
if matrix[i][j] == '1' {
-
if i == 0 || j == 0 {
-
dp[i][j] = 1
-
} else {
-
dp[i][j] = min(dp[i-1][j], min(dp[i][j-1], dp[i-1][j-1])) 1
-
}
-
if dp[i][j] > maxLen {
-
maxLen = dp[i][j]
-
}
-
}
-
}
-
}
-
return maxLen * maxLen
-
}
-
-
func min(a, b int) int {
-
if a < b {
-
return a
-
}
-
return b
-
}
-
-
func main() {
-
matrix := [][]byte{{'1', '0', '1', '0', '0'}, {'1', '0', '1', '1', '1'}, {'1', '1', '1', '1', '1'}, {'1', '0', '0', '1', '0'}}
-
fmt.Println(maximalSquare(matrix))
-
matrix = [][]byte{{'0', '1'}, {'1', '0'}}
-
fmt.Println(maximalSquare(matrix))
-
matrix = [][]byte{{'0'}}
-
fmt.Println(maximalSquare(matrix))
-
}
代码3: 动态规划优化
-
package main
-
-
import (
-
"fmt"
-
)
-
-
func maximalSquare(matrix [][]byte) int {
-
m, n := len(matrix), len(matrix[0])
-
maxLen := 0
-
cur := make([]int, n)
-
pre := make([]int, n)
-
for i := 0; i < m; i {
-
for j := 0; j < n; j {
-
if matrix[i][j] == '1' {
-
if i == 0 || j == 0 {
-
cur[j] = 1
-
} else {
-
cur[j] = min(pre[j], min(cur[j-1], pre[j-1])) 1
-
}
-
if cur[j] > maxLen {
-
maxLen = cur[j]
-
}
-
} else {
-
cur[j] = 0
-
}
-
}
-
cur, pre = pre, cur
-
}
-
return maxLen * maxLen
-
}
-
-
func min(a, b int) int {
-
if a < b {
-
return a
-
}
-
return b
-
}
-
-
func main() {
-
matrix := [][]byte{{'1', '0', '1', '0', '0'}, {'1', '0', '1', '1', '1'}, {'1', '1', '1', '1', '1'}, {'1', '0', '0', '1', '0'}}
-
fmt.Println(maximalSquare(matrix))
-
matrix = [][]byte{{'0', '1'}, {'1', '0'}}
-
fmt.Println(maximalSquare(matrix))
-
matrix = [][]byte{{'0'}}
-
fmt.Println(maximalSquare(matrix))
-
}
输出:
4
1
0
222. 完全二叉树的节点个数 Count Complete Tree Nodes
给你一棵 完全二叉树 的根节点 root
,求出该树的节点个数。
完全二叉树的定义如下:在完全二叉树中,除了最底层节点可能没填满外,其余每层节点数都达到最大值,并且最下面一层的节点都集中在该层最左边的若干位置。若最底层为第 h
层,则该层包含 1~2^h
个节点。
示例 1:
输入:root = [1,2,3,4,5,6]
输出:6
示例 2:
输入:root = []
输出:0
示例 3:
输入:root = [1]
输出:1
提示:
- 树中节点的数目范围是
[0, 5 * 10^4]
0 <= Node.val <= 5 * 10^4
- 题目数据保证输入的树是 完全二叉树
进阶:遍历树来统计节点是一种时间复杂度为 O(n)
的简单解决方案。你可以设计一个更快的算法吗?
代码1: dfs
完全二叉树,可以通过比较根节点左子树高度和右子树高度来确定它是否可以被视为完全二叉树。如果左右高度相等,则该树是满二叉树,节点个数为 2ℎ−12h−1;否则,该树可以被分成一棵满二叉树和一颗子树,递归计算子树的节点数
-
package main
-
-
import "fmt"
-
-
const null = -1 << 31
-
-
type TreeNode struct {
-
Val int
-
Left *TreeNode
-
Right *TreeNode
-
}
-
-
func countNodes(root *TreeNode) int {
-
if root == nil {
-
return 0
-
}
-
var left, right uint
-
left, right = 0, 0
-
for node := root; node != nil; node = node.Left {
-
left
-
}
-
for node := root; node != nil; node = node.Right {
-
right
-
}
-
if left == right {
-
return (1 << left) - 1
-
} else {
-
return countNodes(root.Left) countNodes(root.Right) 1
-
}
-
}
-
-
func buildTree(nums []int) *TreeNode {
-
if len(nums) == 0 {
-
return nil
-
}
-
root := &TreeNode{Val: nums[0]}
-
Queue := []*TreeNode{root}
-
idx := 1
-
for idx < len(nums) {
-
node := Queue[0]
-
Queue = Queue[1:]
-
if nums[idx] != null {
-
node.Left = &TreeNode{Val: nums[idx]}
-
Queue = append(Queue, node.Left)
-
}
-
idx
-
if idx < len(nums) && nums[idx] != null {
-
node.Right = &TreeNode{Val: nums[idx]}
-
Queue = append(Queue, node.Right)
-
}
-
idx
-
}
-
return root
-
}
-
-
func main() {
-
nums := []int{1, 2, 3, 4, 5, 6}
-
root := buildTree(nums)
-
fmt.Println(countNodes(root))
-
nums = []int{}
-
root = buildTree(nums)
-
fmt.Println(countNodes(root))
-
nums = []int{1}
-
root = buildTree(nums)
-
fmt.Println(countNodes(root))
-
}
注:位运算符 <<
要求右侧的操作数必须为无符号整数类型。在 Go 语言中,如果左侧操作数不是无符号整数,右侧操作数必须用无符号整数类型转换。
代码2:bfs
将根节点放入队列中,然后对于队列中的每一个节点,将它的左右子节点入队,统计队列的大小即为节点个数
-
package main
-
-
import "fmt"
-
-
const null = -1 << 31
-
-
type TreeNode struct {
-
Val int
-
Left *TreeNode
-
Right *TreeNode
-
}
-
-
func countNodes(root *TreeNode) int {
-
if root == nil {
-
return 0
-
}
-
q := []*TreeNode{root}
-
count := 0
-
for len(q) > 0 {
-
size := len(q)
-
count = size
-
for i := 0; i < size; i {
-
node := q[i]
-
if node.Left != nil {
-
q = append(q, node.Left)
-
}
-
if node.Right != nil {
-
q = append(q, node.Right)
-
}
-
}
-
q = q[size:]
-
}
-
return count
-
}
-
-
func buildTree(nums []int) *TreeNode {
-
if len(nums) == 0 {
-
return nil
-
}
-
root := &TreeNode{Val: nums[0]}
-
Queue := []*TreeNode{root}
-
idx := 1
-
for idx < len(nums) {
-
node := Queue[0]
-
Queue = Queue[1:]
-
if nums[idx] != null {
-
node.Left = &TreeNode{Val: nums[idx]}
-
Queue = append(Queue, node.Left)
-
}
-
idx
-
if idx < len(nums) && nums[idx] != null {
-
node.Right = &TreeNode{Val: nums[idx]}
-
Queue = append(Queue, node.Right)
-
}
-
idx
-
}
-
return root
-
}
-
-
func main() {
-
nums := []int{1, 2, 3, 4, 5, 6}
-
root := buildTree(nums)
-
fmt.Println(countNodes(root))
-
nums = []int{}
-
root = buildTree(nums)
-
fmt.Println(countNodes(root))
-
nums = []int{1}
-
root = buildTree(nums)
-
fmt.Println(countNodes(root))
-
}
代码3:二分法
-
package main
-
-
import "fmt"
-
-
const null = -1 << 31
-
-
type TreeNode struct {
-
Val int
-
Left *TreeNode
-
Right *TreeNode
-
}
-
-
func countNodes(root *TreeNode) int {
-
if root == nil {
-
return 0
-
}
-
left, right := countHeight(root.Left), countHeight(root.Right)
-
if left == right {
-
return (1 << left) countNodes(root.Right)
-
} else {
-
return (1 << right) countNodes(root.Left)
-
}
-
}
-
-
func countHeight(root *TreeNode) uint {
-
if root == nil {
-
return 0
-
}
-
return countHeight(root.Left) 1
-
}
-
-
func buildTree(nums []int) *TreeNode {
-
if len(nums) == 0 {
-
return nil
-
}
-
root := &TreeNode{Val: nums[0]}
-
Queue := []*TreeNode{root}
-
idx := 1
-
for idx < len(nums) {
-
node := Queue[0]
-
Queue = Queue[1:]
-
if nums[idx] != null {
-
node.Left = &TreeNode{Val: nums[idx]}
-
Queue = append(Queue, node.Left)
-
}
-
idx
-
if idx < len(nums) && nums[idx] != null {
-
node.Right = &TreeNode{Val: nums[idx]}
-
Queue = append(Queue, node.Right)
-
}
-
idx
-
}
-
return root
-
}
-
-
func main() {
-
nums := []int{1, 2, 3, 4, 5, 6}
-
root := buildTree(nums)
-
fmt.Println(countNodes(root))
-
nums = []int{}
-
root = buildTree(nums)
-
fmt.Println(countNodes(root))
-
nums = []int{1}
-
root = buildTree(nums)
-
fmt.Println(countNodes(root))
-
}
输出:
6
0
1
🌟 每日一练刷题专栏 🌟
✨ 持续,努力奋斗做强刷题搬运工!
👍 点赞,你的认可是我坚持的动力!
🌟 收藏,你的青睐是我努力的方向!
✎ 评论,你的意见是我进步的财富!
☸ 主页:https://hannyang.blog.csdn.net/
Rust每日一练 专栏(2023.5.16~)更新中... |
|
Golang每日一练 专栏(2023.3.11~)更新中... |
|
Python每日一练 专栏(2023.2.18~2023.5.18)暂停更 |
|
C/C 每日一练 专栏(2023.2.18~2023.5.18)暂停更 |
|
Java每日一练 专栏(2023.3.11~2023.5.18)暂停更 |
这篇好文章是转载于:学新通技术网
- 版权申明: 本站部分内容来自互联网,仅供学习及演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,请提供相关证据及您的身份证明,我们将在收到邮件后48小时内删除。
- 本站站名: 学新通技术网
- 本文地址: /boutique/detail/tanhgfbjbe
-
photoshop保存的图片太大微信发不了怎么办
PHP中文网 06-15 -
Android 11 保存文件到外部存储,并分享文件
Luke 10-12 -
《学习通》视频自动暂停处理方法
HelloWorld317 07-05 -
word里面弄一个表格后上面的标题会跑到下面怎么办
PHP中文网 06-20 -
photoshop扩展功能面板显示灰色怎么办
PHP中文网 06-14 -
微信公众号没有声音提示怎么办
PHP中文网 03-31 -
excel下划线不显示怎么办
PHP中文网 06-23 -
excel打印预览压线压字怎么办
PHP中文网 06-22 -
怎样阻止微信小程序自动打开
PHP中文网 06-13 -
TikTok加速器哪个好免费的TK加速器推荐
TK小达人 10-01