We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3f7bcc9 commit a729356Copy full SHA for a729356
Dynamic Programming/NinjaTraining.java
@@ -0,0 +1,25 @@
1
+public class NinjaTraining {
2
+ public static int ninjaTraining(int n, int points[][]) {
3
+ int dim = points.length;
4
+ int[][] dp = new int[dim][3];
5
+
6
+ for(int i = 0;i<dim; i++){
7
+ for(int j = 0; j<points[i].length; j++){
8
+ if(i == 0){
9
+ dp[i][j] = points[i][j];
10
+ continue;
11
+ }
12
13
+ for(int k = 0; k<points[i].length; k++){
14
+ if(k == j){
15
16
17
+ dp[i][j] = Math.max(dp[i][j], points[i][j]+dp[i-1][k]);
18
19
20
21
22
+ return Math.max(dp[dim - 1][0], Math.max(dp[dim - 1][1], dp[dim - 1][2]));
23
24
25
+}
0 commit comments