-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDecryptStringFromAlphabetToIntegerMapping.php
More file actions
44 lines (42 loc) · 1.26 KB
/
Copy pathDecryptStringFromAlphabetToIntegerMapping.php
File metadata and controls
44 lines (42 loc) · 1.26 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
<?php
namespace App;
/**
* Decrypt String from Alphabet to Integer Mapping
*
* You are given a string s formed by digits and '#'. We want to map s to English lowercase characters as follows:
* - Characters ('a' to 'i') are represented by ('1' to '9') respectively.
* - Characters ('j' to 'z') are represented by ('10#' to '26#') respectively.
* Return the string formed after mapping. The test cases are generated so that a unique mapping will always exist.
*
* Example 1:
* Input: s = "10#11#12"
* Output: "jkab"
* Explanation: "j" -> "10#" , "k" -> "11#" , "a" -> "1" , "b" -> "2".
*
* Example 2:
* Input: s = "1326#"
* Output: "acz"
*
* https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping
*/
class DecryptStringFromAlphabetToIntegerMapping
{
/**
* @param string $str
* @return string
*/
public function freqAlphabets(string $str): string
{
$result = '';
$length = strlen($str);
for ($i = 0; $i < $length; $i++) {
if ($i + 2 < $length && $str[$i + 2] === '#') {
$result .= chr((int)substr($str, $i, 2) + 96);
$i += 2;
} else {
$result .= chr((int)$str[$i] + 96);
}
}
return $result;
}
}