zoukankan      html  css  js  c++  java
  • 渡一 6 函数,小练习,初识作用域

    定义

    1.命名函数表达式
    var test = function abc(){
        console.log("a");
    }
    2.匿名函数表达式
    var demo = function(){
        console.log("a");
    }
    //形参,实参
    function sum(a,b,c,d){
        if(sum.length > arguments.length){
            console.log("形参多了");
        }else if(sum.length < arguments.length){
            console.log("实参多了")
        }else{
            console.log("一样多")
        }
    }
    
    sum(11,2,3)
    
    //不定实参求和
    function sum(){
        var result = 0;
        for(var i=0;i<arguments.length;i++){
            result += arguments[i];
        }
        console.log(result);
    }
    sum(1,2,3,3,5,4);
    
    
    //实参和arguments是否对应
    function sum(a,b){
        a = 2;
        arguments[0] = 3;
        console.log(a);
    }
    sum(1,2);
    
    function sum(a,b){
        b = 2
        console.log(arguments[1]);//undefined 实参没有b,arguments没有映射关系
    }
    sum(1);
    //typeof两种写法
    typeof(a);
    typeof a;

    练习


    1.写一个函数,功能是告知你所选定的小动物的叫声;

    var animal = window.prompt("input");
    function sound(target){
        switch(target){
            case "dog":
                return "wang!";
            case "cat":
                return "miao"
        }
    }
    console.log(sound(animal));

    2.写一个函数,实现加法计数器。

    var n = parseInt(window.prompt("input"));
    var result = 0;
    function sum(num){
        for(var i=0; i<num; i++){
            result += i;
        }
        console.log(result);
    }
    sum(n);

    3.定义一个函数,输入数字,逆转并输入汉字形式;

    function reverse(){
        var num = window.prompt("input");
        var str = "";
        for(var i=num.length-1; i>=0; i--){
            str += transfer(num[i]);
        }
        console.log(str);
    }
    function transfer(target){
        switch(target){
            case "1":
                return '壹';
            case "2":
                return '贰';
            case "3":
                return '叁';
            case "4":
                return '肆';
            case "5":
                return '伍';
            case "6":
                return '陆';
            case "7":
                return '柒';
            case "8":
                return '捌';
            case "9":
                return '玖';
        }
    }
    reverse()
  • 相关阅读:
    Minimum Depth of Binary Tree leetcode java
    Maximum Depth of Binary Tree leetcode java
    Symmetric Tree leetcode java
    Same Tree leetcode java
    Binary Tree Postorder Traversal leetcode java
    Binary Tree Preorder Traversal leetcode java
    Binary Tree Inorder Traversal leetcode java
    Combinations leetcode java
    一键清除Centos iptables 防火墙所有规则
    阿里云centos7.7x64安装open,并配置ip转发和nat伪装
  • 原文地址:https://www.cnblogs.com/lisa2544/p/15388584.html
Copyright © 2011-2022 走看看