string-without-aaa-or-bbb

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two integers <code>a</code> and <code>b</code>, return any string <code>s</code> such that:

<ul>
	<li><code>s</code> has length <code>a + b</code> and contains exactly <code>a</code> <code>&#39;a&#39;</code> letters, and exactly <code>b</code> <code>&#39;b&#39;</code> letters,</li>
	<li>The substring <code>&#39;aaa&#39;</code> does not occur in <code>s</code>, and</li>
	<li>The substring <code>&#39;bbb&#39;</code> does not occur in <code>s</code>.</li>
</ul>

&nbsp;
Example 1:

<pre>
Input: a = 1, b = 2
Output: &quot;abb&quot;
Explanation: &quot;abb&quot;, &quot;bab&quot; and &quot;bba&quot; are all correct answers.
</pre>

Example 2:

<pre>
Input: a = 4, b = 1
Output: &quot;aabaa&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= a, b &lt;= 100</code></li>
	<li>It is guaranteed such an <code>s</code> exists for the given <code>a</code> and <code>b</code>.</li>
</ul>

strWithout3a3b

String Without AAA or BBB

Greedy

String

给定两个整数 <code>a</code>&nbsp;和 <code>b</code>&nbsp;，返回&nbsp;任意&nbsp;字符串 <code>s</code>&nbsp;，要求满足：

<ul>
	<li><code>s</code>&nbsp;的长度为 <code>a + b</code>，且正好包含&nbsp;<code>a</code>&nbsp;个 <code>'a'</code>&nbsp;字母与&nbsp;<code>b</code> 个 <code>'b'</code>&nbsp;字母；</li>
	<li>子串&nbsp;<code>'aaa'</code>&nbsp;没有出现在 <code>s</code>&nbsp;中；</li>
	<li>子串&nbsp;<code>'bbb'</code> 没有出现在 <code>s</code>&nbsp;中。</li>
</ul>

&nbsp;

示例 1：

<pre>
输入：a = 1, b = 2
输出："abb"
解释："abb", "bab" 和 "bba" 都是正确答案。
</pre>

示例 2：

<pre>
输入：a = 4, b = 1
输出："aabaa"</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= a, b&nbsp;&lt;= 100</code></li>
	<li>对于给定的 <code>a</code> 和 <code>b</code>，保证存在满足要求的 <code>s</code>&nbsp;</li>
</ul>
​​​