面试题之算法汇总

思路1:<span style="color: #000000">把A去重得到A1</span>,B去重得到B1,然后对A1,B1分别进行排序,然后遍历较短的字符串的每个字符是否存在于较长的字符串中,<span style="color: #000000">存在则输出问题</span>:1.思路很简单,基本大家都会这么考虑,<span style="color: #000000">但是面试的时候就没有亮点了思路2</span>:<span style="color: #000000">假设AB串只包含小写(其实无所谓)</span>,那么创建一个数组,数组的key为a->z,<span style="color: #000000">value都是0;</span><?<span style="color: #000000">php    </span><span style="color: #0000ff">function</span> stringToChar(<span style="color: #800080">$str</span>,<span style="color: #800080">$num</span>=1,<span style="color: #800080">$tmp</span>=<span style="color: #0000ff">null</span><span style="color: #000000">){        </span><span style="color: #0000ff">if</span>(<span style="color: #0000ff">empty</span>(<span style="color: #800080">$tmp</span><span style="color: #000000">)){</span><span style="color: #800080">$tmp</span>=<span style="color: #0000ff">array</span>('a'=>0,'b'=>0,'c'=>0,'d'=>0,'e'=>0,'f'=>0,'g'=>0,'h'=>0,'i'=>0,'j'=>0,'k'=>0,'l'=>0,'m'=>0,'n'=>0,'o'=>0,'p'=>0,'q'=>0,'r'=>0,'s'=>0,'t'=>0,'u'=>0,'v'=>0,'w'=>0,'x'=>0,'y'=>0,'z'=>0<span style="color: #000000">);        }        </span><span style="color: #800080">$arr_temp</span>=<span style="color: #008080">str_split</span>(<span style="color: #800080">$str</span>,1<span style="color: #000000">);        </span><span style="color: #0000ff">foreach</span>(<span style="color: #800080">$arr_temp</span> <span style="color: #0000ff">as</span> <span style="color: #800080">$v</span><span style="color: #000000">){            </span><span style="color: #0000ff">if</span>(<span style="color: #800080">$tmp</span>[<span style="color: #800080">$v</span>]<<span style="color: #800080">$num</span><span style="color: #000000">){                </span><span style="color: #800080">$tmp</span>[<span style="color: #800080">$v</span>]+=<span style="color: #800080">$num</span><span style="color: #000000">;            }        }        </span><span style="color: #0000ff">return</span> <span style="color: #800080">$tmp</span><span style="color: #000000">;    }    </span><span style="color: #0000ff">function</span> getStringIntersect(<span style="color: #800080">$str1</span>, <span style="color: #800080">$str2</span><span style="color: #000000">){        </span><span style="color: #800080">$temp</span>=stringToChar(<span style="color: #800080">$str1</span>,1<span style="color: #000000">);        </span><span style="color: #008000">//</span><span style="color: #008000">$str2的$num用2 就是为了区分 stemp中的<b>6本文来源gao@dai!ma.com搞$代^码!网7</b><pre>搞gaodaima代码

原来的1 是 $str1中设置的 $temp=stringToChar($str2,2,$temp); $result=”; foreach ($temp as $key => $value) { if($value===3){ $result.=$key; } } return $result; } $A=”common”;//“hello”; $B=”month”;//“jeesite”; $result=getStringIntersect($A, $B); echo $result;?>
今天随便浏览网页的时候又发现了这篇文章（一次谷歌面试趣事）
我想起来了 思路二出自这篇文章。

---

搞代码网（gaodaima.com）提供的所有资源部分来自互联网，如果有侵犯您的版权或其他权益，请说明详细缘由并提供版权或权益证明然后发送到邮箱[email protected]‍，我们会在看到邮件的第一时间内为您处理，或直接联系QQ：872152909。本网站采用BY-NC-SA协议进行授权
转载请注明原文链接：面试题之算法汇总

喜欢 (0)赏

[搞代码]

分享 (0)