The Art of Programming on Coinidea's Blog

[LeetCode][PHP Implementation] Contains Duplicate

Tue, 01 Dec 2015 10:06:29 +0000

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23


<?php
class Solution
{
 public function containsDuplicate($nums)
 {
 $hashTable = array();
 foreach ($nums as $num)
 {
 if (!array_key_exists($num,$hashTable))
 {
 $hashTable[$num] = 1;
 }
 else
 {
 return false;
 }
 }
 return true;
 }
}
$solution = new Solution();
echo $solution->containsDuplicate(array(2,1,3,4,5,6,7,9));
?>

[LeetCode][PHP Implementation] Excel Sheet Column Number

Mon, 30 Nov 2015 12:25:48 +0000

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17


<?php
class Solution
{
 public function titleToNumber($s)
 {
 $num = 0;
 $len = strlen($s) - 1;
 for ($i = $len; $i >= 0; $i--)
 {
 $num += (ord($s[$i]) - ord('A') + 1) * (int)pow(26, $len - $i);
 }
 return $num;
 }
}
$solution = new Solution();
echo $solution->titleToNumber("AA");
?>

[LeetCode][PHP Implementation] Valid Anagram

Mon, 30 Nov 2015 12:24:46 +0000

 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


<?php
class Solution
{
 public function isAnagram($s, $t)
 {
 $s = strtolower($s);
 $t = strtolower($t);
 for ($i = 0; $i < 26; $i++)
 {
 $sChars[$i] = 0;
 $tChars[$i] = 0;
 }
 for ($i = 0; $i < strlen($s); $i++)
 {
 $sChars[ord($s[$i]) - ord('a')]++;
 }
 for ($i = 0; $i < strlen($t); $i++)
 {
 $tChars[ord($t[$i]) - ord('a')]++;
 }
 //var_dump($sChars);
 //var_dump($tChars);
 for ($i = 0; $i < 26; $i++)
 {
 if ($sChars[$i] != $tChars[$i])
 {
 return false;
 }
 }
 return true;
 }
}
$solution = new Solution();
echo $solution->isAnagram("HelloWorld", "whelloorld");
?>

[LeetCode][PHP Implementation] Add Digits

Mon, 30 Nov 2015 12:23:52 +0000

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21


<?php
class Solution
{
 public function addDigits($num)
 {
 while ($num > 10)
 {
 $tmp = 0;
 while ($num > 0)
 {
 $tmp += $num % 10;
 $num = intval($num / 10);
 }
 $num = $tmp;
 }
 return $num;
 }
}
$solution = new Solution();
echo $solution->addDigits(381);
?>

[LeetCode][PHP Implementation] Two Sum

Mon, 30 Nov 2015 12:22:21 +0000

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24


<?php
class solution
{
 public function twoSum($nums, $target)
 {
 $result = array();
 for ($i = 0; $i < count($nums); $i++)
 {
 for ($j = 0; $j < count($nums); $j++)
 {
 if ($target == $nums[$i] + $nums[$j])
 {
 $result[0] = $i + 1;
 $result[1] = $j + 1;
 return $result;
 }
 }
 }
 return $result;
 }
}
$solution = new Solution();
var_dump($solution->twoSum(array(2,7,11,15), 9));
?>

[LeetCode][PHP Implementation] Single Number

Mon, 30 Nov 2015 12:20:03 +0000

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17


<?php
class Solution
{
 public function singleNumber($nums)
 {
 $single = 0;
 foreach ($nums as $num)
 {
 $single ^= $num;
 echo $num;
 }
 return $single;
 }
}
$solution = new Solution();
echo $solution->singleNumber(array(1,1,2,3,2,4,4,5,3));
?>