42 动态规划-猴子上山

DataIntel

于 2023-12-10 16:44:04 发布

阅读量613

点赞数 21

文章标签：动态规划算法 java

本文链接：https://blog.csdn.net/u012545581/article/details/134910611

版权

import java.util.Scanner;
 
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    System.out.println(getResult(n));
  }
 
  public static int getResult(int n) {
    int[] dp = new int[n + 1];
 
    if (n >= 1) dp[1] = 1;
    if (n >= 2) dp[2] = 1;
    if (n >= 3) dp[3] = 2;
 
    for (int i = 4; i <= n; i++) {
      dp[i] = dp[i - 1] + dp[i - 3];
    }
 
    return dp[n];
  }
}