Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
M
map-parent
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
常超
map-parent
Commits
82fae39c
Commit
82fae39c
authored
Nov 17, 2023
by
yangyang
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
lcss优化提交
parent
1f221440
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
1 deletions
+2
-1
common/common_utils/src/main/java/com/founder/commonutils/util/map/LCSS.java
+2
-1
No files found.
common/common_utils/src/main/java/com/founder/commonutils/util/map/LCSS.java
View file @
82fae39c
...
...
@@ -55,6 +55,7 @@ public class LCSS {
//内层遍历第二条轨迹
for
(
int
j
=
0
;
j
<
len2
;
j
++)
{
// 时间范围比较 俩个点之间的时差
if
(
StringUtils
.
isNotBlank
(
l1
.
get
(
i
).
getTime
())&&
StringUtils
.
isNotBlank
(
l2
.
get
(
j
).
getTime
())){
long
timeIterval
=
Long
.
parseLong
(
l1
.
get
(
i
).
getTime
())
-
Long
.
parseLong
(
l2
.
get
(
j
).
getTime
());
//第一条轨迹的第i个点和第二条轨迹的第j个点是否在radius范围内 && 俩个点之间的时差小于等于minutes && 俩个点之间的时差大于等于-minutes
if
(
isNearby
(
l1
.
get
(
i
),
l2
.
get
(
j
),
radius
)
&&
timeIterval
<=
timeItervalMinutes
&&
timeIterval
>=-
timeItervalMinutes
)
{
...
...
@@ -75,7 +76,7 @@ public class LCSS {
//for循环知道行数列数的情况
System
.
out
.
print
(
"3++++"
+
flag
[
i
+
1
][
j
+
1
]
+
" "
);
}
}
}
}
printLcs
(
flag
,
l1
,
len1
,
len2
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment