number-of-different-integers-in-a-string

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>word</code> that consists of digits and lowercase English letters.

You will replace every non-digit character with a space. For example, <code>&quot;a123bc34d8ef34&quot;</code> will become <code>&quot; 123&nbsp; 34 8&nbsp; 34&quot;</code>. Notice that you are left with some integers that are separated by at least one space: <code>&quot;123&quot;</code>, <code>&quot;34&quot;</code>, <code>&quot;8&quot;</code>, and <code>&quot;34&quot;</code>.

Return the number of different integers after performing the replacement operations on <code>word</code>.

Two integers are considered different if their decimal representations without any leading zeros are different.

&nbsp;
Example 1:

<pre>
Input: word = &quot;a123bc34d8ef34&quot;
Output: 3
Explanation: The three different integers are &quot;123&quot;, &quot;34&quot;, and &quot;8&quot;. Notice that &quot;34&quot; is only counted once.
</pre>

Example 2:

<pre>
Input: word = &quot;leet1234code234&quot;
Output: 2
</pre>

Example 3:

<pre>
Input: word = &quot;a1b01c001&quot;
Output: 1
Explanation: The three integers &quot;1&quot;, &quot;01&quot;, and &quot;001&quot; all represent the same integer because
the leading zeros are ignored when comparing their decimal values.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word.length &lt;= 1000</code></li>
	<li><code>word</code> consists of digits and lowercase English letters.</li>
</ul>

numDifferentIntegers

Number of Different Integers in a String

Longest Subarray With Maximum Bitwise AND

longest-subarray-with-maximum-bitwise-and

按位与最大的最长子数组

Hash Table

String

给你一个字符串 <code>word</code> ，该字符串由数字和小写英文字母组成。

请你用空格替换每个不是数字的字符。例如，<code>"a123bc34d8ef34"</code> 将会变成 <code>" 123  34 8  34"</code> 。注意，剩下的这些整数为（相邻彼此至少有一个空格隔开）：<code>"123"</code>、<code>"34"</code>、<code>"8"</code> 和 <code>"34"</code> 。

返回对 <code>word</code> 完成替换后形成的 不同 整数的数目。

只有当两个整数的 不含前导零 的十进制表示不同， 才认为这两个整数也不同。

 

示例 1：

<pre>
输入：word = "a123bc34d8ef34"
输出：3
解释：不同的整数有 "123"、"34" 和 "8" 。注意，"34" 只计数一次。
</pre>

示例 2：

<pre>
输入：word = "leet1234code234"
输出：2
</pre>

示例 3：

<pre>
输入：word = "a1b01c001"
输出：1
解释："1"、"01" 和 "001" 视为同一个整数的十进制表示，因为在比较十进制值时会忽略前导零的存在。
</pre>

 

提示：

<ul>
	<li><code>1 <= word.length <= 1000</code></li>
	<li><code>word</code> 由数字和小写英文字母组成</li>
</ul>