Construct K Palindrome Strings LeetCode solution in Java

1
class Solution {
2
  public boolean canConstruct(String s, int k) {
3
    if (k == s.length()) {
4
      return true;
5
    } else if (k > s.length()) {
6
      return false;
7
    }
8
    Map<Character, Integer> map = new HashMap<Character, Integer>();
9
    for (int i = 0; i < s.length(); i++) {
10
      if (map.containsKey(s.charAt(i))) {
11
        int count = map.get(s.charAt(i));
12
        map.put(s.charAt(i), count + 1);
13
      } else {
14
        map.put(s.charAt(i), 1);
15
      }
16
    }
17
    int odd = 0;
18
    for (Map.Entry<Character, Integer> ele : map.entrySet()) {
19
      if ((ele.getValue() % 2) == 1) {
20
        odd++;
21
      }
22
    }
23
    return (odd <= k);
24
  }
25
}