890. Find and Replace Pattern

作者：璃夕KaSyow₠│2019-12-11 14:58:46│巴幣：0│人氣：96

You have a list of words and a pattern, and you want to know which words in words matches the pattern.

A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word.

(Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter.)

Return a list of the words in words that match the given pattern.

You may return the answer in any order.

class Solution {

    /**
     * @param String[] $words
     * @param String $pattern
     * @return String[]
     */
    function findAndReplacePattern($words, $pattern) {

        $res = array();
        $map1 =array();
        $map2 =array(); for($i=0;$i<count($words);$i++){
            $this->initmap($map1,$map2);
            $p = true ;
            for($s=0;$s<strlen($words[$i]);$s++){
                var_dump($map1[ord($pattern[$s])-97]);
                if($map1[ord($pattern[$s])-97] === 0 && $map2[ord($words[$i][$s])-97] === 0){

                    $map1[ord($pattern[$s])-97] = $words[$i][$s];
                    $map2[ord($words[$i][$s])-97] = 1;
                }else if($map1[ord($pattern[$s])-97]!==$words[$i][$s]){
                    $p =false ;
                    break;
                }

            }
            if($p === true){
                array_push($res,$words[$i]);
            }
        }
        return $res ;
    }
    function initmap(&$m1,&$m2){
        if(isset($m1[0])){
            for($i=0;$i<26;$i++){
                $m1[$i] = $m2[$i] =0;
            }
        }else{
            for($i=0;$i<26;$i++){
                array_push($m1,0);
                array_push($m2,0);
            }
        }
    }
}

喜歡收藏引用留言推上首頁檢舉

引用網址：https://home.gamer.com.tw/TrackBack.php?sn=4617942
All rights reserved. 版權所有，保留一切權利

相關創作