Java实现俄罗斯套娃游戏代码：计算最大嵌套深度

```java import java.util.Scanner; public class RussianDoll { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.println("请输入俄罗斯套娃的数量："); int n = scanner.nextInt(); int[] dolls = new int[n]; System.out.println("请输入每个套娃的直径："); for (int i = 0; i < n; i++) { dolls[i] = scanner.nextInt(); } System.out.println("最大嵌套深度为：" + maxNestingDepth(dolls)); } public static int maxNestingDepth(int[] dolls) { int n = dolls.length; int[] dp = new int[n]; int maxDepth = 1; for (int i = 0; i < n; i++) { dp[i] = 1; for (int j = 0; j < i; j++) { if (dolls[j] < dolls[i]) { dp[i] = Math.max(dp[i], dp[j] + 1); } } maxDepth = Math.max(maxDepth, dp[i]); } return maxDepth; } } ``` ######[AI写代码神器 | 342点数解答 | 2024-07-17 11:39:08]