本库为记录自己日常学习力扣算法的仓库，如有侵权部分，请联系本人删除

QQ：1161645687

class Solution

{

/**

public function findWords($words)

{

$map = ['a' => 2, 'b' => 3, 'c' => 3, 'd' => 2, 'e' => 1, 'f' => 2, 'g' => 2, 'h' => 2, 'i' => 1, 'j' => 2, 'k' => 2, 'l' => 2, 'm' => 3, 'n' => 3, 'o' => 1, 'p' => 1, 'q' => 1, 'r' => 1, 's' => 2, 't' => 1, 'u' => 1, 'v' => 3, 'w' => 1, 'x' => 3, 'y' => 1, 'z' => 3];

$newWords = [];

foreach ($words as $word) {

$len = strlen($word);

$temp_word = strtolower($word);

// 第一个的map值

$line = $map[$temp_word[0]];

$is_append = true;

for ($i = 0; $i < $len; $i++) {

$temp = $map[$temp_word[$i]];

if ($temp !== $line) {

$is_append = false;

break;

}

}

if ($is_append) {

$newWords[] = $word;

}

}

return $newWords;

}

}

$solution = new Solution();

var_dump($solution->findWords(["Hello", "Alaska", "Dad", "Peace"]));

$len = count($A);

$j = 0;

for ($i = 0; $i < $len; $i++) {

if (($A[$i] % 2 === 0)) {

$temp = $A[$j];

$A[$j] = $A[$i];

$A[$i] = $temp;

$j++;

}

}

return $A;

var_dump($solution->sortArrayByParity([3, 2, 1, 4]));