JS:一个字符串由[a-z]组成,找出第一个只出现一次的字母

<!DOCTYPE html>
<html>
<head>
    <meta charset="utf-8">
    <title>Document</title>
</head>
<body>
    <script>
    var mystr = 'asdasdasdwdascxc';
        function fis(str){//97
            var len = str.length;
            var arr = [];
            for(var i = 0 ;i < 26 ;i++){
                arr[i] = 0;
            }
            for(var i = 0 ;i < len; i++){
                var s = str[i].charCodeAt()-97;
                arr[s] ++;
            }
            for(var i = 0; i < len; i++){
//                 console.log(str[i]);
                if(arr[str[i].charCodeAt()-97] == 1){
//                 var letter = String.fromCharCode(97 + i);
                console.log(str[i]);
                return ;
                }
            }
            console.log("No that letter!")
            return ;
        }
        fis(mystr);
    </script>

</body>
</html>

猜你喜欢

转载自blog.csdn.net/duyujian706709149/article/details/83997519