Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
GreyZeng
algorithm
提交
59f96ffe
A
algorithm
项目概览
GreyZeng
/
algorithm
通知
10
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
A
algorithm
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
59f96ffe
编写于
1月 29, 2024
作者:
GreyZeng
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
update code
上级
7dba2891
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
25 addition
and
31 deletion
+25
-31
src/main/java/git/snippet/heap/NowCoder_LineCoverMax2.java
src/main/java/git/snippet/heap/NowCoder_LineCoverMax2.java
+25
-31
未找到文件。
src/main/java/git/snippet/heap/NowCoder_LineCoverMax2.java
浏览文件 @
59f96ffe
...
...
@@ -12,54 +12,48 @@ import java.util.PriorityQueue;
// 堆解法
// 线段树解法 TODO
public
class
NowCoder_LineCoverMax2
{
// 暴力解法
private
static
int
maxCover
(
int
[][]
arr
)
{
Line
[]
lines
=
toLine
(
arr
);
int
min
=
lines
[
0
].
start
;
int
max
=
lines
[
0
].
end
;
// 暴力解法,无法过牛客测评,可以通过对数器来验证
public
static
int
maxCover
(
int
[][]
lines
)
{
if
(
null
==
lines
||
lines
.
length
==
0
)
{
return
0
;
}
int
min
=
lines
[
0
][
0
];
int
max
=
lines
[
0
][
1
];
for
(
int
i
=
1
;
i
<
lines
.
length
;
i
++)
{
m
ax
=
Math
.
max
(
max
,
lines
[
i
].
end
);
m
in
=
Math
.
min
(
min
,
lines
[
i
].
start
);
m
in
=
Math
.
min
(
min
,
lines
[
i
][
0
]
);
m
ax
=
Math
.
max
(
max
,
lines
[
i
][
1
]
);
}
int
coverMax
=
0
;
int
cover
=
0
;
int
maxCover
=
0
;
for
(
int
i
=
min
;
i
<=
max
;
i
++)
{
for
(
Line
line
:
lines
)
{
if
(
line
.
start
<=
i
+
0.5
&&
line
.
end
>=
i
+
0.5
)
{
int
cover
=
0
;
for
(
int
[]
line
:
lines
)
{
if
(
line
[
0
]
<=
i
+
0.1
&&
line
[
1
]
>=
i
+
0.1
)
{
cover
++;
}
}
coverMax
=
Math
.
max
(
cover
,
coverMax
);
cover
=
0
;
maxCover
=
Math
.
max
(
maxCover
,
cover
);
}
return
coverMax
;
return
maxCover
;
}
// 堆解法
public
static
int
maxCover2
(
int
[][]
arr
)
{
Line
[]
lines
=
toLine
(
arr
);
Arrays
.
sort
(
lines
,
Comparator
.
comparingInt
(
o
->
o
.
start
));
PriorityQueue
<
Line
>
heap
=
new
PriorityQueue
<>(
Comparator
.
comparingInt
(
o
->
o
.
end
));
int
max
=
1
;
for
(
Line
line
:
lines
)
{
while
(!
heap
.
isEmpty
()
&&
heap
.
peek
().
end
<=
line
.
start
)
{
public
static
int
maxCover2
(
int
[][]
lines
)
{
if
(
null
==
lines
||
lines
.
length
==
0
)
{
return
0
;
}
Arrays
.
sort
(
lines
,
Comparator
.
comparingInt
(
line
->
line
[
0
]));
PriorityQueue
<
int
[]>
heap
=
new
PriorityQueue
<>(
Comparator
.
comparingInt
(
line
->
line
[
1
]));
int
max
=
0
;
for
(
int
[]
line
:
lines
)
{
while
(!
heap
.
isEmpty
()
&&
heap
.
peek
()[
1
]
<=
line
[
0
])
{
heap
.
poll
();
}
heap
.
offer
(
line
);
max
=
Math
.
max
(
heap
.
size
(),
max
);
max
=
Math
.
max
(
max
,
heap
.
size
()
);
}
return
max
;
}
private
static
Line
[]
toLine
(
int
[][]
arr
)
{
Line
[]
lines
=
new
Line
[
arr
.
length
];
for
(
int
i
=
0
;
i
<
arr
.
length
;
i
++)
{
lines
[
i
]
=
new
Line
(
arr
[
i
][
0
],
arr
[
i
][
1
]);
}
return
lines
;
}
public
static
int
[][]
generateLines
(
int
N
,
int
L
,
int
R
)
{
int
size
=
(
int
)
(
Math
.
random
()
*
N
)
+
1
;
int
[][]
ans
=
new
int
[
size
][
2
];
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录