数组转换的小题目

1.数组去重

    var arr =[2,3,4,2,2,5,6,4,3,7,7,7,8,5,9];
    for(var j =0;j <arr.length;j++){
        var f =arr[j];
        for(var k =j+1;k <arr.length;k++){
            if(f==arr[k]){
                arr.splice(k,1);
                k--;
            }
        }
    }
   console.log(arr);

结果为：
[2, 3, 4, 5, 6, 7, 8, 9]

2.数组合并+去重

   var r ="abcgha";
    var c ="yihfgf";
    var m =r.concat(c);
  // console.log(m);
   var n = m.split("");
  // console.log(n);
   for(var j =0;j <n.length;j++){
       var f =n[j];
       for(var k =j+1;k <n.length;k++){
           if(f==n[k]){
               n.splice(k,1);
               k--;
           }
       }
   }
   console.log(n);

结果为：
[“a”, “b”, “c”, “g”, “h”, “y”, “i”, “f”]

3.翻转字符串

var str="wertyjkg";
   //法一
   var str1="";
    for(var i=str.length-1;i>=0;i--){
        str1+=str[i];
    }
   console.log(str1);
   //法二
    var str2=str.split("").reverse ().join("");
   console.log(str2);

结果为：
gkjytrew

4.找一句话中的最长单词 返回这个单词的长度

 var a1="To be or not to1 be12 , this is a question questions  12345678987870 ";//To be or not to1 be12 , this is a question question
   a1=a1.split(" ");
   console.log(a1);
   var save=[0,""];
    function long(m){
        for(var k=0;k <m.length;k++){
          if(isNaN(m[k])){
            if(m[k].length>save[0]){
               save.splice (1, save.length-2);
                save[0]= m[k].length;
                save[1]= m[k];
            }
            else if(m[k].length==save[0]){
              save.push(m[k]);
            }
          }
        }
        console.log(save[0]);
    }
   long(a1);

结果为：
[“To”, “be”, “or”, “not”, “to1”, “be12”, “,”, “this”, “is”, “a”, “question”, “questions”, “”, “12345678987870”, “”]
9