Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
congyangmin
DataMiningAlgorithm
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
DataMiningAlgorithm
/
SequentialPatterns
/
DataMining_GSP
/
ItemSet.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
82 lines (68 loc) · 1.31 KB
master
Breadcrumbs
DataMiningAlgorithm
/
SequentialPatterns
/
DataMining_GSP
/
ItemSet.java
Copy path
Top
File metadata and controls
Code
Blame
82 lines (68 loc) · 1.31 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package
DataMining_GSP
;
import
java
.
util
.
ArrayList
;
/**
* 序列中的子项集
*
* @author lyq
*
*/
public
class
ItemSet
{
/**
* 项集中保存的是数字项数组
*/
private
ArrayList
<
Integer
>
items
;
public
ItemSet
(
String
[]
itemStr
) {
items
=
new
ArrayList
<>();
for
(
String
s
:
itemStr
) {
items
.
add
(
Integer
.
parseInt
(
s
));
}
}
public
ItemSet
(
int
[]
itemNum
) {
items
=
new
ArrayList
<>();
for
(
int
num
:
itemNum
) {
items
.
add
(
num
);
}
}
public
ItemSet
(
ArrayList
<
Integer
>
itemNum
) {
this
.
items
=
itemNum
;
}
public
ArrayList
<
Integer
>
getItems
() {
return
items
;
}
public
void
setItems
(
ArrayList
<
Integer
>
items
) {
this
.
items
=
items
;
}
/**
* 判断2个项集是否相等
*
* @param itemSet
* 比较对象
* @return
*/
public
boolean
compareIsSame
(
ItemSet
itemSet
) {
boolean
result
=
true
;
if
(
this
.
items
.
size
() !=
itemSet
.
items
.
size
()) {
return
false
;
}
for
(
int
i
=
0
;
i
<
itemSet
.
items
.
size
();
i
++) {
if
(
this
.
items
.
get
(
i
) !=
itemSet
.
items
.
get
(
i
)) {
// 只要有值不相等,直接算作不相等
result
=
false
;
break
;
}
}
return
result
;
}
/**
* 拷贝项集中同样的数据一份
*
* @return
*/
public
ArrayList
<
Integer
>
copyItems
() {
ArrayList
<
Integer
>
copyItems
=
new
ArrayList
<>();
for
(
int
num
:
this
.
items
) {
copyItems
.
add
(
num
);
}
return
copyItems
;
}
}
You can’t perform that action at this time.