FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/src/main/java/com/thealgorithms/strings/Pangram.java at master · aroonkumar/Java · GitHub
aroonkumar
Java
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
thealgorithms
/
strings
/
Pangram.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
80 lines (74 loc) · 2.38 KB
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
thealgorithms
/
strings
/
Pangram.java
Copy path
File metadata and controls
80 lines (74 loc) · 2.38 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
package
com
.
thealgorithms
.
strings
;
import
java
.
util
.
HashSet
;
/**
* Wikipedia: https://en.wikipedia.org/wiki/Pangram
*/
public
final
class
Pangram
{
private
Pangram
() {
}
/**
* Test code
*/
public
static
void
main
(
String
[]
args
) {
assert
isPangram
(
"The quick brown fox jumps over the lazy dog"
);
assert
!
isPangram
(
"The quick brown fox jumps over the azy dog"
);
// L is missing
assert
!
isPangram
(
"+-1234 This string is not alphabetical"
);
assert
!
isPangram
(
"
\u0000
/
\\
"
);
}
/**
* Checks if a String is considered a Pangram
*
* @param s The String to check
* @return {@code true} if s is a Pangram, otherwise {@code false}
*/
// alternative approach using Java Collection Framework
public
static
boolean
isPangramUsingSet
(
String
s
) {
HashSet
<
Character
>
alpha
=
new
HashSet
<>();
s
=
s
.
trim
().
toLowerCase
();
for
(
int
i
=
0
;
i
<
s
.
length
();
i
++) {
if
(
s
.
charAt
(
i
) !=
' '
) {
alpha
.
add
(
s
.
charAt
(
i
));
}
}
return
alpha
.
size
() ==
26
;
}
/**
* Checks if a String is considered a Pangram
*
* @param s The String to check
* @return {@code true} if s is a Pangram, otherwise {@code false}
*/
public
static
boolean
isPangram
(
String
s
) {
boolean
[]
lettersExisting
=
new
boolean
[
26
];
for
(
char
c
:
s
.
toCharArray
()) {
int
letterIndex
=
c
- (
Character
.
isUpperCase
(
c
) ?
'A'
:
'a'
);
if
(
letterIndex
>=
0
&&
letterIndex
<
lettersExisting
.
length
) {
lettersExisting
[
letterIndex
] =
true
;
}
}
for
(
boolean
letterFlag
:
lettersExisting
) {
if
(!
letterFlag
) {
return
false
;
}
}
return
true
;
}
/**
* Checks if a String is Pangram or not by checking if each alphabet is present or not
*
* @param s The String to check
* @return {@code true} if s is a Pangram, otherwise {@code false}
*/
public
static
boolean
isPangram2
(
String
s
) {
if
(
s
.
length
() <
26
) {
return
false
;
}
s
=
s
.
toLowerCase
();
// Converting s to Lower-Case
for
(
char
i
=
'a'
;
i
<=
'z'
;
i
++) {
if
(
s
.
indexOf
(
i
) == -
1
) {
return
false
;
// if any alphabet is not present, return false
}
}
return
true
;
}
}
Back
|
FazBrowse Home
|
New Git URL