Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- import java.util.List;
- public class FifthExercise {
- public static void main(String[] args) {
- List<String> strings = Arrays.asList("Pawel", "Krzysztof", "Bartosz");
- String wordWithTheBiggestAmountOfLowerCaseLetters =
- findWordWithTheBiggestAmountOfLowerCaseLetters(strings);
- System.out.println(wordWithTheBiggestAmountOfLowerCaseLetters);
- }
- private static String findWordWithTheBiggestAmountOfLowerCaseLetters(List<String> strings) {
- String returnWord = "";
- int currentWordLowerCaseCount = Integer.MIN_VALUE;
- int counter;
- for (String wordToCheck : strings) {
- char[] chars = wordToCheck.toCharArray();
- counter = 0;
- for (Character character : chars) {
- if (Character.isLowerCase(character)) {
- ++counter;
- }
- }
- if (counter > currentWordLowerCaseCount) {
- returnWord = wordToCheck;
- currentWordLowerCaseCount = counter;
- }
- }
- return returnWord;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement