Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
nth fibonacci ( memoization )
//'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_111 import java.util.*; import java.lang.*; class Rextester { public static int fibo(int n){ if(n==0) return 0; int[] memo = new int[n+1]; memo[0] = 0; memo[1] = 1; for(int i=2;i<=n;i++) memo[i] = -1; return helper(memo,n); } public static int helper(int[] arr,int n){ if(arr[n]!=-1) return arr[n]; return helper(arr,n-2)+helper(arr,n-1); } public static void main(String args[]) { System.out.println("Hello, World!"); System.out.println(fibo(9)); } }
run
|
edit
|
history
|
help
0
A
메소드구현하기-해결
Sort arraylist bubble sort
Sort an array of 0's 1's 2's 3 pointer approach
Counter.java
1a
Java # Bir Cumlenin uzunluğu
Even Numbers
linear search
Sample for https://stackoverflow.com/a/49984959/4216641