GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — java-basics/java-programs/DynamicProgramming/ncr.java at master · learning-zone/java-basics Expand file tree/ Copy pathncr.javaMore file actions 61 lines (46 loc) · 1.05 KB / Copy pathncr.javaFile metadata and controls61 lines (46 loc) · 1.05 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 package DynamicProgramming; import java.util.Arrays; public class ncr { public static int NcR(int n, int r) { if (n == 1 || r == 0 || n == r) { return 1; } if (r == 1) { return n; } return NcR(n - 1, r) + NcR(n - 1, r - 1); } public static int dpApproach(int n, int r) { if(r > n) return -1; if(n == r) return 1; if(r == 0) return n; int[][] dp = new int[n + 1][r + 1]; for (int i = 1; i <= n; i++) { for (int j = 0; j <= r; j++) { if (i >= j) { if (j == 0) { dp[i][j] = i; } else if (i == j) { dp[i][j] = 1; } else if (j == 1) { dp[i][j] = i; } else { dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % 1000000007; } } } } // print(dp); return dp[n][r]; } public static void print(int[][] arr) { for(int i = 0; i < arr.length; i++) { System.out.println(Arrays.toString(arr[i])); } } public static void main(String[] args) { // TODO Auto-generated method stub // System.out.println(NcR(84, 56)); System.out.println(dpApproach(84, 56)); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |