gpt4 book ai didi

java - 如何找出字符串 's' 的每个字符重复了多少次

转载 作者:太空宇宙 更新时间:2023-11-04 12:08:11 26 4
gpt4 key购买 nike

我搜索并发现了一些类似的问题,但似乎不知道如何将它们应用于我的问题。请耐心等待,因为这是我在该网站上的第一篇文章。

我必须找出字符串中的一个字符重复了多少次。例如,如果给出 "launch at noon" ,该方法应打印:

"l" appears once in "launch at noon".
"a" appears twice in "launch at noon".
"u" appears once in " launch at noon ".
"n" appears 3 times in "launch at noon".
"c" appears once in "launch at noon".
"h" appears once in "launch at noon".
" " appears twice in "launch at noon".
"t" appears once in "launch at noon".
"o" appears twice in "launch at noon".

最佳答案

public void test() {
// The string to test.
String s = "launch at noon";
// Count them.
Map<Character, Integer> characterCounts = countCharacters(s);
// Print the results.
for (Map.Entry<Character, Integer> e : characterCounts.entrySet()) {
int count = e.getValue();
// Work out the name for the number.
String number = count < specials.length
// The special short ones.
? specials[count]
// Is it a general one?
: count < numbersAsWords.length
// Yes
? numbersAsWords[count] + " times"
// Way too many.
: "too many times";
// Print it.
System.out.println("\"" + e.getKey() + "\" appears " + number + " in \"" + s + "\".");
}
}

private Map<Character, Integer> countCharacters(String s) {
// Map from character in string to count of occurrences.
Map<Character, Integer> counts = new HashMap<>();
// Walk the string.
for (int i = 0; i < s.length(); i++) {
// Get character at that point.
char ch = s.charAt(i);
// What's in the map for that character.
Integer count = counts.get(ch);
if (count == null) {
// Not seen this character before - start at zero.
count = 0;
}
// Increment seen count.
count += 1;
// Put it back in the map.
counts.put(ch, count);
}
return counts;
}

// The short ones.
private static final String[] specials = {"not at all", "once", "twice"};

// The rest.
private static final String[] numbersAsWords = {"zero",
"one",
"two",
"three",
"four",
"five",
"six",
"seven",
"eight",
"nine",
"ten",
"eleven",
"twelve",
"thirteen",
"fourteen",
"fifteen",
"sixteen",
"seventeen",
"eighteen",
"nineteen",
"twenty",
"twenty-one",
"twenty-two",
"twenty-three",
"twenty-four",
"twenty-five",
"twenty-six",
"twenty-seven",
"twenty-eight",
"twenty-nine",
"thirty",
"thirty-one",
"thirty-two",
"thirty-three",
"thirty-four",
"thirty-five",
"thirty-six",
"thirty-seven",
"thirty-eight",
"thirty-nine",
"forty",
"forty-one",
"forty-two",
"forty-three",
"forty-four",
"forty-five",
"forty-six",
"forty-seven",
"forty-eight",
"forty-nine",
"fifty",
"fifty-one",
"fifty-two",
"fifty-three",
"fifty-four",
"fifty-five",
"fifty-six",
"fifty-seven",
"fifty-eight",
"fifty-nine",
"sixty",
"sixty-one",
"sixty-two",
"sixty-three",
"sixty-four",
"sixty-five",
"sixty-six",
"sixty-seven",
"sixty-eight",
"sixty-nine",
"seventy",
"seventy-one",
"seventy-two",
"seventy-three",
"seventy-four",
"seventy-five",
"seventy-six",
"seventy-seven",
"seventy-eight",
"seventy-nine",
"eighty",
"eighty-one",
"eighty-two",
"eighty-three",
"eighty-four",
"eighty-five",
"eighty-six",
"eighty-seven",
"eighty-eight",
"eighty-nine",
"ninety",
"ninety-one",
"ninety-two",
"ninety-three",
"ninety-four",
"ninety-five",
"ninety-six",
"ninety-seven",
"ninety-eight",
"ninety-nine",
"one hundred",
};

关于java - 如何找出字符串 's' 的每个字符重复了多少次,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/40133060/

26 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com