diff --git a/alis-amu/alis-amu-example/src/main/resources/application.properties b/alis-amu/alis-amu-example/src/main/resources/application.properties new file mode 100644 index 0000000..8b13789 --- /dev/null +++ b/alis-amu/alis-amu-example/src/main/resources/application.properties @@ -0,0 +1 @@ + diff --git a/alis-amu/alis-amu-example/src/test/java/org/alis/amu/explame/AlisAmuExampleApplicationTests.java b/alis-amu/alis-amu-example/src/test/java/org/alis/amu/explame/AlisAmuExampleApplicationTests.java new file mode 100644 index 0000000..1791418 --- /dev/null +++ b/alis-amu/alis-amu-example/src/test/java/org/alis/amu/explame/AlisAmuExampleApplicationTests.java @@ -0,0 +1,13 @@ +package org.alis.amu.explame; + +import org.junit.jupiter.api.Test; +import org.springframework.boot.test.context.SpringBootTest; + +@SpringBootTest +class AlisAmuExampleApplicationTests { + + @Test + void contextLoads() { + } + +} diff --git a/alis-amu/alis-amu-server/src/test/java/org/alis/amu/AlisAmuServerApplicationTests.java b/alis-amu/alis-amu-server/src/test/java/org/alis/amu/AlisAmuServerApplicationTests.java new file mode 100644 index 0000000..d645672 --- /dev/null +++ b/alis-amu/alis-amu-server/src/test/java/org/alis/amu/AlisAmuServerApplicationTests.java @@ -0,0 +1,13 @@ +package org.alis.amu; + +import org.junit.jupiter.api.Test; +import org.springframework.boot.test.context.SpringBootTest; + +@SpringBootTest +class AlisAmuServerApplicationTests { + + @Test + void contextLoads() { + } + +} diff --git a/datastructure/src/main/java/org/alis/smallcc/algorithm/leetcode/LeetCode17.java b/datastructure/src/main/java/org/alis/smallcc/algorithm/leetcode/LeetCode17.java new file mode 100644 index 0000000..0fb9d23 --- /dev/null +++ b/datastructure/src/main/java/org/alis/smallcc/algorithm/leetcode/LeetCode17.java @@ -0,0 +1,39 @@ +package org.alis.smallcc.algorithm.leetcode; + +/** + * 动态规划 算法 + * n个楼梯 走法只能一步或者走两步 请问一共有多少种走法 + * + * @author alis + */ +public class LeetCode17 { + + public static void main(String[] args) { + Integer count = advanced(1000); + System.out.println(count); + } + + private static Integer advanced(Integer n) { + + if (n == 1) { + return 1; + } + + if (n == 2) { + return 2; + } + + int a = 1; + int b = 2; + int temp = 0; + + for (int i = 3; i <= n; i++) { + temp = a + b; + a=b; + b=temp; + + } + return temp; + } + +} \ No newline at end of file diff --git a/pom.xml b/pom.xml index f2b9d67..8e21d74 100644 --- a/pom.xml +++ b/pom.xml @@ -33,11 +33,11 @@ 2021.1 1.18.16 5.7.15 - 8.0.27 + 8.0.28 3.4.1 1.2.4 2.2.0 - 2.13.0 + 2.13.2.2 3.0.2 2.3.0 8.20.1 @@ -65,9 +65,9 @@ 1.5.22 1.0-SNAPSHOT 1.4.2.Final - 1.2.41 + 1.2.80 8.8.0 - 1.13.1 + 1.14.3 3.1.0 31.0.1-jre 3.0.1