58|2018春招笔试题解
判断两个字符串能否组成回文,对s1从头扫描,对s2从尾扫描,判断是否都相等即可。
参考代码
function getHuiwenCouple(a){ if(a.length==0)return false; let res=[]; let i=0,m=a[0].length; let k=~~(a.length/2)+1; while(k--){ let j=a.length-1; while(j>i){ if(isHuiWen(a[i],a[j],m)){ let tmp=[]; tmp.push(a[i],a[j]); res.push(tmp); } j--; } i++; } return res; } function isHuiWen(s1,s2,m){ if(s1.length==0||s2.length==0)return false; let i=0,j=m-1; while(m--){ if(s1[i]!=s2[j]){ return false; } i++; j--; } return true; } let arr=["aba","aba","cba","abc","def"]; console.log(getHuiwenCouple(arr));