// =================== 求最大值=====================================
    <script>
        var arr = [10,35,765,21345,678,89];
        var max = arr [0];
        for (var i=0;i< arr.length;i++) {
            if (max<arr[i]){
                max = arr [i];
            }
        }
        console.log("最大值:" + max);
    </script>
// =================== 求最小值=====================================
    <script>
        var arr = [10,35,765,21345,678,89];
        var max = arr [0];
        for (var i=0;i< arr.length;i++) {
            if (max>arr[i]){
                max = arr [i];
            }
        }
        console.log("最小值:" + max);
    </script>
    //  ============================倒序遍歷陣列===============================
    <script>
        var arr = [1,2,3,4,5,6,7,8,9];
        for (var i= arr.length-1;i>=0;i--){
            console.log(arr[i]);
        }
    </script>
    //===========陣列拼接字串===========第一種方法（從前面往後加）=========
    <script>
        var names = ["周杰倫","李連杰","林俊杰","張韶涵","田馥甄"];
        var str = "";
        for (var i = 0; i< names.length-1;i++){
           str += names[i] + "|"
        }
        console.log(str+ names[names.length-1]);
    </script>
    //===========陣列拼接字串===========第二種方法（從後面往前加）=========
    <script>
        var names = ["周杰倫","李連杰","林俊杰","張韶涵","田馥甄"];
        var str = "";
        for (var i = 1; i< names.length;i++){
            str +=  "|" + names[i]
        }
        console.log(names[0]+ str);
    </script>