Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- public class Fibonacci {
- // implement here
- static boolean check(int i,int j,int n)
- {
- if(n<1 || i<j){
- return false;
- }
- else {
- return true;
- }
- }
- static int[] fiboSum(int i, int j, int n)
- {
- if(check(i,j,n))
- {
- int[] arr = new int[10];
- arr[0] = i;
- arr[1] = j;
- for (int k = 2; k < n; k++) {
- arr[k] = arr[k - 1] + arr[k - 2];
- }
- return arr;
- }
- }
- public static void main(String args[])
- {
- Arrays.toString(Fibonacci.fiboSum(2, 4, 6))
- if(check){
- System.out.println(Arrays.toString(Fibonacci.fiboSum(2, 4, 6)));
- }
- else{
- return System.out.println("Incorrect input data: "+i+" ,"+j+" ,"+ n);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement