diff --git a/WebRoot/html/pages/projectManagement/zbzx/xmgl/zhcx/integratedQuery.html b/WebRoot/html/pages/projectManagement/zbzx/xmgl/zhcx/integratedQuery.html index 4e7cda72..b48aa292 100644 --- a/WebRoot/html/pages/projectManagement/zbzx/xmgl/zhcx/integratedQuery.html +++ b/WebRoot/html/pages/projectManagement/zbzx/xmgl/zhcx/integratedQuery.html @@ -185,7 +185,7 @@
- diff --git a/WebRoot/upload/255E1C19-965F-4DC1-AA29-A876F7CEBE45.xlsx b/WebRoot/upload/255E1C19-965F-4DC1-AA29-A876F7CEBE45.xlsx new file mode 100644 index 00000000..d1889a98 Binary files /dev/null and b/WebRoot/upload/255E1C19-965F-4DC1-AA29-A876F7CEBE45.xlsx differ diff --git a/WebRoot/upload/65040C7D-FDD1-40F3-B85E-B2EFD68C1D14.xlsx b/WebRoot/upload/65040C7D-FDD1-40F3-B85E-B2EFD68C1D14.xlsx new file mode 100644 index 00000000..d1889a98 Binary files /dev/null and b/WebRoot/upload/65040C7D-FDD1-40F3-B85E-B2EFD68C1D14.xlsx differ diff --git a/WebRoot/upload/B7DCABAD-14C6-43DA-AF6D-134E1D6459FA.xlsx b/WebRoot/upload/B7DCABAD-14C6-43DA-AF6D-134E1D6459FA.xlsx new file mode 100644 index 00000000..d1889a98 Binary files /dev/null and b/WebRoot/upload/B7DCABAD-14C6-43DA-AF6D-134E1D6459FA.xlsx differ diff --git a/WebRoot/view/jrgl/xtgl/index.html b/WebRoot/view/jrgl/xtgl/index.html index fb3ee141..57abb126 100644 --- a/WebRoot/view/jrgl/xtgl/index.html +++ b/WebRoot/view/jrgl/xtgl/index.html @@ -94,7 +94,7 @@ class="woo-theme-color">重置密码 - 上传文档 @@ -106,6 +106,7 @@ class="woo-theme-color">下载文档 {{# } }} + - + - - 测试 - + + + + + + + + + + + + -
- 1
1
1
1
1
1
- +
+
+

+ 获取已展开 + 展开所有 + 关闭所有 +

+ + + + + + + +
- diff --git a/src/main/java/UnitTest/test01.java b/src/main/java/UnitTest/test01.java new file mode 100644 index 00000000..3f60358b --- /dev/null +++ b/src/main/java/UnitTest/test01.java @@ -0,0 +1,28 @@ +package UnitTest; + +public class test01 { + /* 零钱兑换:贪心 */ + private static int coinChangeGreedy(int[] coins, int amt) { + // 假设 coins 列表有序 + int i = coins.length - 1; + int count = 0; + // 循环进行贪心选择,直到无剩余金额 + while (amt > 0) { + // 找到小于且最接近剩余金额的硬币 + while (i > 0 && coins[i] > amt) { + i--; + } + // 选择 coins[i] + amt -= coins[i]; + System.out.println(coins[i]); + count++; + } + // 若未找到可行方案,则返回 -1 + return amt == 0 ? count : -1; + } + public static void main(String[] args) { + + int[] coins = {1,5,10,20,50,100}; + System.out.println(coinChangeGreedy(coins,1257)); + } +}