Question

Consider the following class definition class FibSequence implements Iterablexnteger public Iterator<Integer> iterator) return new FibIterator); private class FibIterator implements Iterator<Integer> f //complete this You are required to create an inner class in the FibSequence class. The inner class should be called FibIterator. It implements the Iterator<Integer> interface and implements the hasNext() and the next() methods. The iterator iterates through the Fibonacci sequence. The Fibonacci sequence is a series of numbers where a number is the sum of previous two numbers. Starting with 0 and 1, the sequence goes 0, 1, 1, 2, 3, 5, 8, 13, 21, and so on. The iterator does not put any condition to end the loop meaning that its hasNext () method always return true. At each iteration, the next) method computes and returns the next element in the sequence. Note: you are not required to implement the remove() method. Use the following code fragment: public void remove() throw new UnsupportedOperationException); Insert the FibIterator class in the answer box below and within the FibSequence class For example Test Result FibSequence dsnew FibSequence) Iterator<Integer iteratords.iterator) for (int i : ds) { 1 235 8 13 21 34 if (i > 40) break; System.out.print(i); Answer (penalty regime: 0 %) 1 class FibSequence implements Iterable<Integer> 2public Iterator Integer iterator) f return new FibonacciIterator); 4 5private class FibonacciIterator implements Iterator<Integer> int prevVal -, curVal -1; public void remove) throw new UnsupportedoperationException(); //complete this: Integer next() and boolean hasNext() 10 12 13 14

Answer 1

package com.test;

import java.util.Iterator;

public class FibSequence implements Iterable<Integer> {
   //Main method
   public static void main(String[] args) {
       //Create object
       FibSequence fs = new FibSequence();
       //Get iterator
       Iterator<Integer> it = fs.iterator();
       //Loop thru itwrator
       while (it.hasNext()) {
           //Check if i > 40 if so break
           int i = it.next();
           if ( i > 40) {
               break;
           }
           //Print
           System.out.print(i + " ");
       }
   }
   //New iterator class
   private class FibonacciIterator implements Iterator<Integer> {
       //Variable to hold values
       int n1 = 0, n2 = 1, n3;
       //return true
       @Override
       public boolean hasNext() {
           // TODO Auto-generated method stub
           return true;
       }

       @Override
       public Integer next() {
           // TODO Auto-generated method stub
           //CAlculate series
           n3 = n1 + n2;
           // System.out.print(" "+n3);
           n1 = n2;
           n2 = n3;
           //return current element
           return n3;
       }

       public void remove() {
           throw new UnsupportedOperationException();
       }

   }

   @Override
   public Iterator<Integer> iterator() {
       // TODO Auto-generated method stub
       return new FibonacciIterator();
   }

}
---------

Output

1 2 3 5 8 13 21 34