-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path1078-occurrences-after-bigram.php
71 lines (62 loc) · 1.8 KB
/
1078-occurrences-after-bigram.php
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
<?php
// 1078. Occurrences After Bigram
// https://leetcode.com/problems/occurrences-after-bigram/
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// Runtime: 8 ms, faster than 25.00% of PHP online submissions
// for Occurrences After Bigram.
// Memory Usage: 14.7 MB, less than 100.00% of PHP online submissions
// for Occurrences After Bigram.
class Solution
{
/**
* @param String $text
* @param String $first
* @param String $second
* @return String[]
*/
function findOcurrences($text, $first, $second)
{
$arr = explode(' ', $text);
$occurrences = [];
for ($i = 2; $i < count($arr); $i++) {
if ($first === $arr[$i - 2] && $second === $arr[$i - 1]) {
array_push($occurrences, $arr[$i]);
}
}
return $occurrences;
}
}
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
$tests = [
[
'input' => [
'text' => 'alice is a good girl she is a good student',
'first' => 'a',
'second' => 'good',
],
'expected' => ['girl', 'student'],
],
[
'input' => [
'text' => 'we will we will rock you',
'first' => 'we',
'second' => 'will',
],
'expected' => ['we', 'rock'],
],
];
$s = new Solution();
foreach ($tests as $test) {
extract($test);
extract($input);
$output = $s->findOcurrences($text, $first, $second);
if ($expected === $output) {
echo "✅ {$text}<br>";
} else {
echo "🔴 {$text}<br>";
echo 'Expected the below';
echo '<pre>', print_r($expected, true), '</pre>';
echo 'But got the below instead';
echo '<pre>', print_r($output, true), '</pre>';
}
}