splitting-a-string-into-descending-consecutive-values

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a string <code>s</code> that consists of only digits.

Check if we can split <code>s</code> into two or more non-empty substrings such that the numerical values of the substrings are in descending order and the difference between numerical values of every two adjacent substrings is equal to <code>1</code>.

<ul>
	<li>For example, the string <code>s = &quot;0090089&quot;</code> can be split into <code>[&quot;0090&quot;, &quot;089&quot;]</code> with numerical values <code>[90,89]</code>. The values are in descending order and adjacent values differ by <code>1</code>, so this way is valid.</li>
	<li>Another example, the string <code>s = &quot;001&quot;</code> can be split into <code>[&quot;0&quot;, &quot;01&quot;]</code>, <code>[&quot;00&quot;, &quot;1&quot;]</code>, or <code>[&quot;0&quot;, &quot;0&quot;, &quot;1&quot;]</code>. However all the ways are invalid because they have numerical values <code>[0,1]</code>, <code>[0,1]</code>, and <code>[0,0,1]</code> respectively, all of which are not in descending order.</li>
</ul>

Return <code>true</code> if it is possible to split <code>s</code>​​​​​​ as described above, or <code>false</code> otherwise.

A substring is a contiguous sequence of characters in a string.

&nbsp;
Example 1:

<pre>
Input: s = &quot;1234&quot;
Output: false
Explanation: There is no valid way to split s.
</pre>

Example 2:

<pre>
Input: s = &quot;050043&quot;
Output: true
Explanation: s can be split into [&quot;05&quot;, &quot;004&quot;, &quot;3&quot;] with numerical values [5,4,3].
The values are in descending order with adjacent values differing by 1.
</pre>

Example 3:

<pre>
Input: s = &quot;9080701&quot;
Output: false
Explanation: There is no valid way to split s.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 20</code></li>
	<li><code>s</code> only consists of digits.</li>
</ul>

splitString

Splitting a String Into Descending Consecutive Values

String

Backtracking

给你一个仅由数字组成的字符串 <code>s</code> 。

请你判断能否将 <code>s</code> 拆分成两个或者多个 非空子字符串 ，使子字符串的 数值 按 降序 排列，且每两个 相邻子字符串 的数值之 差 等于 <code>1</code> 。

<ul>
	<li>例如，字符串 <code>s = "0090089"</code> 可以拆分成 <code>["0090", "089"]</code> ，数值为 <code>[90,89]</code> 。这些数值满足按降序排列，且相邻值相差 <code>1</code> ，这种拆分方法可行。</li>
	<li>另一个例子中，字符串 <code>s = "001"</code> 可以拆分成 <code>["0", "01"]</code>、<code>["00", "1"]</code> 或 <code>["0", "0", "1"]</code> 。然而，所有这些拆分方法都不可行，因为对应数值分别是 <code>[0,1]</code>、<code>[0,1]</code> 和 <code>[0,0,1]</code> ，都不满足按降序排列的要求。</li>
</ul>

如果可以按要求拆分 <code>s</code> ，返回 <code>true</code> ；否则，返回 <code>false</code> 。

子字符串 是字符串中的一个连续字符序列。

 

示例 1：

<pre>
输入：s = "1234"
输出：false
解释：不存在拆分 s 的可行方法。
</pre>

示例 2：

<pre>
输入：s = "050043"
输出：true
解释：s 可以拆分为 ["05", "004", "3"] ，对应数值为 [5,4,3] 。
满足按降序排列，且相邻值相差 <code>1</code> 。
</pre>

示例 3：

<pre>
输入：s = "9080701"
输出：false
解释：不存在拆分 s 的可行方法。
</pre>

示例 4：

<pre>
输入：s = "10009998"
输出：true
解释：s 可以拆分为 ["100", "099", "98"] ，对应数值为 [100,99,98] 。
满足按降序排列，且相邻值相差 <code>1</code> 。</pre>

 

提示：

<ul>
	<li><code>1 <= s.length <= 20</code></li>
	<li><code>s</code> 仅由数字组成</li>
</ul>