Package g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions

Class Solution

java.lang.Object
g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions.Solution
public class Solution extends Object
1737 - Change Minimum Characters to Satisfy One of Three Conditions.<p>Medium</p> <p>You are given two strings <code>a</code> and <code>b</code> that consist of lowercase letters. In one operation, you can change any character in <code>a</code> or <code>b</code> to <strong>any lowercase letter</strong>.</p> <p>Your goal is to satisfy <strong>one</strong> of the following three conditions:</p> <ul> <li><strong>Every</strong> letter in <code>a</code> is <strong>strictly less</strong> than <strong>every</strong> letter in <code>b</code> in the alphabet.</li> <li><strong>Every</strong> letter in <code>b</code> is <strong>strictly less</strong> than <strong>every</strong> letter in <code>a</code> in the alphabet.</li> <li><strong>Both</strong> <code>a</code> and <code>b</code> consist of <strong>only one</strong> distinct letter.</li> </ul> <p>Return <em>the <strong>minimum</strong> number of operations needed to achieve your goal.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> a = &ldquo;aba&rdquo;, b = &ldquo;caa&rdquo;</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Consider the best way to make each condition true:</p> <ol> <li> <p>Change b to &ldquo;ccc&rdquo; in 2 operations, then every letter in a is less than every letter in b.</p> </li> <li> <p>Change a to &ldquo;bbb&rdquo; and b to &ldquo;aaa&rdquo; in 3 operations, then every letter in b is less than every letter in a.</p> </li> <li> <p>Change a to &ldquo;aaa&rdquo; and b to &ldquo;aaa&rdquo; in 2 operations, then a and b consist of one distinct letter. The best way was done in 2 operations (either condition 1 or condition 3).</p> </li> </ol> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> a = &ldquo;dabadd&rdquo;, b = &ldquo;cda&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> The best way is to make condition 1 true by changing b to &ldquo;eee&rdquo;.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= a.length, b.length <= 10<sup>5</sup></code></li> <li><code>a</code> and <code>b</code> consist only of lowercase letters.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minCharacters

      public int minCharacters(String s1, String s2)