forked from AllenDowney/ThinkJavaCode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStringThings.java
More file actions
72 lines (61 loc) · 1.58 KB
/
Copy pathStringThings.java
File metadata and controls
72 lines (61 loc) · 1.58 KB
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
import java.util.Arrays;
import java.util.Scanner;
public class StringThings {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String input1 = in.nextLine();
String input2 = in.nextLine();
System.out.println(canSpell(input1, input2));
}
public static boolean isAbecedarian(String s) {
for (int i = 0; i < s.length() - 1; i++) {
if (s.charAt(i) > s.charAt(i + 1)) {
return false;
}
}
return true;
}
public static boolean isDoubloon(String s) {
s = s.toLowerCase();
int[] hist = letterHist(s);
for (int i = 0; i < hist.length; i++) {
if (hist[i] != 2 && hist[i] != 0) {
return false;
}
}
return true;
}
public static int[] letterHist(String inputString) {
int[] hist = new int[26];
String newString = inputString.toLowerCase().replace(" ", "");
for (int i = 0; i < newString.length(); i++) {
char letter = newString.charAt(i);
hist[letter - 'a']++;
}
return hist;
}
public static boolean isAnagram(String s1, String s2) {
s1 = s1.toLowerCase().replace(" ", "");
s2 = s2.toLowerCase().replace(" ", "");
int[] hist1 = letterHist(s1);
int[] hist2 = letterHist(s2);
for (int i = 0; i < hist1.length; i++) {
if (hist1[i] != hist2[i]) {
return false;
}
}
return true;
}
public static boolean canSpell(String s1, String s2) {
s1 = s1.toLowerCase().replace(" ", "");
s2 = s2.toLowerCase().replace(" ", "");
int[] hist1 = letterHist(s1);
int[] hist2 = letterHist(s2);
for (int i = 0; i < hist1.length; i++) {
if (hist1[i] < hist2[i]) {
return false;
}
}
return true;
}
}