Package g1301_1400.s1400_construct_k_palindrome_strings

Class Solution

java.lang.Object

g1301_1400.s1400_construct_k_palindrome_strings.Solution

public class Solution
extends Object

1400 - Construct K Palindrome Strings.<p>Medium</p> <p>Given a string <code>s</code> and an integer <code>k</code>, return <code>true</code> <em>if you can use all the characters in</em> <code>s</code> <em>to construct</em> <code>k</code> <em>palindrome strings or</em> <code>false</code> <em>otherwise</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;annabelle&rdquo;, k = 2</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> You can construct two palindromes using all characters in s. Some possible constructions &ldquo;anna&rdquo; + &ldquo;elble&rdquo;, &ldquo;anbna&rdquo; + &ldquo;elle&rdquo;, &ldquo;anellena&rdquo; + &ldquo;b&rdquo;</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;leetcode&rdquo;, k = 3</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> It is impossible to construct 3 palindromes using all the characters of s.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> s = &ldquo;true&rdquo;, k = 4</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> The only possible solution is to put each character in a separate string.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 10⁵</code></li> <li><code>s</code> consists of lowercase English letters.</li> <li><code>1 <= k <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	canConstruct(String s, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

canConstruct

public boolean canConstruct(String s,
 int k)