Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
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 }}
Mars2018
Leetcode-Java
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
WildcardMatching.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
34 lines (31 loc) · 1.51 KB
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
WildcardMatching.java
Copy path
Top
File metadata and controls
Code
Blame
34 lines (31 loc) · 1.51 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
public
class
WildcardMatching
{
// 这道题关键是遇到"*"的处理以及后面匹配失败时的回溯
// 只要有"*",当后面匹配失败时就有重试的机会
public
boolean
isMatch2
(
String
s
,
String
p
) {
int
is
=
0
,
ip
=
0
,
ks
= -
1
,
kp
= -
1
;
while
(
is
<
s
.
length
()) {
// 如果当前能匹配则往下走
if
(
ip
<
p
.
length
() && (
s
.
charAt
(
is
) ==
p
.
charAt
(
ip
) ||
p
.
charAt
(
ip
) ==
'?'
)) {
is
++;
ip
++;
}
else
if
(
ip
<
p
.
length
() &&
p
.
charAt
(
ip
) ==
'*'
) {
// 如果遇到"*"记下s和p当前位置,便于后面匹配失败时回溯,遇到新的"*"时会覆盖之前的"*"
// 这里is不递增,仅ip递增
ks
=
is
;
kp
=
ip
;
ip
++;
}
else
if
(
kp
!= -
1
) {
// 如果p到头了,或者匹配失败了,回归到之前记下的位置,注意每次回溯时的p的位置都是固定的,但是
// 回溯时的s的位置每次都要加1,因为上次的位置是失败的,所以这次回溯要跳过上次的位置
is
= ++
ks
;
ip
=
kp
+
1
;
}
else
{
// p到头了,或者匹配失败了,但是没有可回溯的
return
false
;
}
}
// 这里要跳过重复的*,如果p也到头了,则是匹配的
for
( ;
ip
<
p
.
length
() &&
p
.
charAt
(
ip
) ==
'*'
;
ip
++);
return
ip
==
p
.
length
();
}
}
You can’t perform that action at this time.