fengchuanyu 1 tydzień temu
rodzic
commit
1599804133

+ 19 - 2
3_JavaScript/16_函数.html

@@ -102,9 +102,26 @@
         function foo15(){
             console.log("foo15")
         }
-        var x = foo15();
-        console.log(x)
+        // var x = foo15();
+        // console.log(x)
+
+        // 递归自己调用自己 
+        // 使用递归的时候一定要有出口
+        function foo16(i){
+            if(i>10){
+                return false;
+            }
+            console.log(i)
+            foo16(++i);
+        }
+        // foo16(1)
+
+        // 斐波那契数列
+        // 1 1 2 3 5 8 
 
+        // 平方函数
+        console.log(Math.pow(2,2))
+        
 
 
     </script>

+ 21 - 0
3_JavaScript/练习15_阶层函数.html

@@ -0,0 +1,21 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+<body>
+    <script>
+        
+        function factorial(n){
+            var res = 1;
+            for(var i=1;i<=n;i++){
+                res *= i;
+            }
+            return res;
+        }
+        console.log(factorial(12)-factorial(10));
+    </script>
+</body>
+</html>

+ 27 - 0
3_JavaScript/练习16_星号图形函数.html

@@ -0,0 +1,27 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+    <script>
+        function foo(n) {
+            for (var i = 0; i < n; i++) {
+                for (var k = n; k > i; k--) {
+                    document.write("&nbsp;");
+                }
+                for (var j = 0; j <= i; j++) {
+                    document.write("*&nbsp;");
+                }
+                document.write("<br>");
+            }
+        }
+        foo(10);
+    </script>
+</body>
+
+</html>