hash-divided-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>s</code> of length <code>n</code> and an integer <code>k</code>, where <code>n</code> is a multiple of <code>k</code>. Your task is to hash the string <code>s</code> into a new string called <code>result</code>, which has a length of <code>n / k</code>.

First, divide <code>s</code> into <code>n / k</code> substrings, each with a length of <code>k</code>. Then, initialize <code>result</code> as an empty string.

For each substring in order from the beginning:

<ul>
	<li>The hash value of a character is the index of that character in the English alphabet (e.g., <code>&#39;a&#39; &rarr; 0</code>, <code>&#39;b&#39; &rarr; 1</code>, ..., <code>&#39;z&#39; &rarr; 25</code>).</li>
	<li>Calculate the sum of all the hash values of the characters in the substring.</li>
	<li>Find the remainder of this sum when divided by 26, which is called <code>hashedChar</code>.</li>
	<li>Identify the character in the English lowercase alphabet that corresponds to <code>hashedChar</code>.</li>
	<li>Append that character to the end of <code>result</code>.</li>
</ul>

Return <code>result</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;abcd&quot;, k = 2

Output: &quot;bf&quot;

Explanation:

First substring: <code>&quot;ab&quot;</code>, <code>0 + 1 = 1</code>, <code>1 % 26 = 1</code>, <code>result[0] = &#39;b&#39;</code>.

Second substring: <code>&quot;cd&quot;</code>, <code>2 + 3 = 5</code>, <code>5 % 26 = 5</code>, <code>result[1] = &#39;f&#39;</code>.
</div>

Example 2:

<div class="example-block">
Input: s = &quot;mxz&quot;, k = 3

Output: &quot;i&quot;

Explanation:

The only substring: <code>&quot;mxz&quot;</code>, <code>12 + 23 + 25 = 60</code>, <code>60 % 26 = 8</code>, <code>result[0] = &#39;i&#39;</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= 100</code></li>
	<li><code>k &lt;= s.length &lt;= 1000</code></li>
	<li><code>s.length</code> is divisible by <code>k</code>.</li>
	<li><code>s</code> consists only of lowercase English letters.</li>
</ul>

stringHash

Hash Divided String

String

Simulation

给你一个长度为 <code>n</code>&nbsp;的字符串 <code>s</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;，<code>n</code>&nbsp;是 <code>k</code>&nbsp;的 倍数&nbsp;。你的任务是将字符串 <code>s</code>&nbsp;哈希为一个长度为 <code>n / k</code>&nbsp;的新字符串&nbsp;<code>result</code>&nbsp;。

首先，将&nbsp;<code>s</code>&nbsp;分割成&nbsp;<code>n / k</code>&nbsp;个&nbsp;子字符串&nbsp;，每个子字符串的长度都为&nbsp;<code>k</code>&nbsp;。然后，将&nbsp;<code>result</code>&nbsp;初始化为一个 空&nbsp;字符串。

我们依次从前往后处理每一个 子字符串&nbsp;：

<ul>
	<li>一个字符的 哈希值&nbsp;是它在 字母表&nbsp;中的下标（也就是&nbsp;<code>'a' → 0</code>&nbsp;，<code>'b' → 1</code>&nbsp;，... ，<code>'z' → 25</code>）。</li>
	<li>将子字符串中字母的 哈希值&nbsp;求和。</li>
	<li>将和对 26 取余，将结果记为&nbsp;<code>hashedChar</code>&nbsp;。</li>
	<li>找到小写字母表中 <code>hashedChar</code>&nbsp;对应的字符。</li>
	<li>将该字符添加到&nbsp;<code>result</code>&nbsp;的末尾。</li>
</ul>

返回&nbsp;<code>result</code>&nbsp;。

&nbsp;

示例 1：

<div class="example-block">
输入：s = "abcd", k = 2

输出："bf"

解释：

第一个字符串为&nbsp;<code>"ab"</code>&nbsp;，<code>0 + 1 = 1</code>&nbsp;，<code>1 % 26 = 1</code>&nbsp;，<code>result[0] = 'b'</code>&nbsp;。

第二个字符串为： <code>"cd"</code>&nbsp;，<code>2 + 3 = 5</code>&nbsp;，<code>5 % 26 = 5</code>&nbsp;，<code>result[1] = 'f'</code>&nbsp;。
</div>

示例 2：

<div class="example-block">
输入：s = "mxz", k = 3

输出："i"

解释：

唯一的子字符串为&nbsp;<code>"mxz"</code>&nbsp;，<code>12 + 23 + 25 = 60</code>&nbsp;，<code>60 % 26 = 8</code>&nbsp;，<code>result[0] = 'i'</code>&nbsp;。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= k &lt;= 100</code></li>
	<li><code>k &lt;= s.length &lt;= 1000</code></li>
	<li><code>s.length</code>&nbsp;能被 <code>k</code>&nbsp;整除。</li>
	<li><code>s</code> 只含有小写英文字母。</li>
</ul>