(java queue fibonacci, 자바수열)자바 큐를 이용한 피보나치 수열, 자바알고리즘, 자바자료구조

(java queue fibonacci, 자바수열)자바 큐를 이용한 피보나치 수열, 자바알고리즘, 자바자료구조

자바 큐를 이용한 피보나치 수열, 자바알고리즘, 자바자료구조

 

import java.io.*;

interface Queue  {  
           public boolean isEmpty();
     public boolean isFull();
           public Object getFrontElement();
           public Object getRearElement();
           public void put(Object theObject);
           public Object remove();
}

public class ArrayQueue implements Queue
     {
           // data members
          int front;          // one counterclockwise from first element
          int rear;           // position of rear element of queue
          Object [] queue;    // element array

         
          public ArrayQueue(int initialCapacity)
         {
               if (initialCapacity < 1)
                    throw new IllegalArgumentException
                      ("initialCapacity must be >= 1");
               queue = new Object [initialCapacity + 1];
               // default front = rear = 0
         }   

   
       public boolean isEmpty() {
      return front == rear;
       }

   
       public boolean isFull() {
      return (rear+1) % queue.length == front;
       }

      
       public Object getFrontElement() {
           if (isEmpty())  return null;
           else return queue[(front + 1) % queue.length];
      }

     
      public Object getRearElement() {
          if (isEmpty())  return null;
          else return queue[rear];
     }
   
     public void put(Object theElement)  {

          // increase array length if necessary
          if ((rear + 1) % queue.length == front) {
            // double array size
            // code to double array size comes here
         }

         // put theElement at the rear of the queue
         rear = (rear + 1) % queue.length;
         queue[rear] = theElement;
     }   

      public Object remove()  {
           if (isEmpty())
               return null;
           front = (front + 1) % queue.length;
          Object frontElement = queue[front];
          queue[front] = null;  // enable garbage collection
          return frontElement;
      }
  }

 

 

class FiboWithQueue {
 void fibo(int n) {
  int[] fib = new int[n];
  int a, b;

  ArrayQueue queue = new ArrayQueue(2);
  fib[0] = fib[1] = 1;
  queue.put(new Integer(1));  // fib(0)
  queue.put(new Integer(1));   //fib(1)
  for(int i=2; i<n; i++) {
   a = ((Integer)queue.getFrontElement()).intValue();
   b = ((Integer)queue.getRearElement()).intValue();
   fib[i] = a + b;
   queue.remove();
   queue.put(new Integer(fib[i]));
  }
  //------------ 수열 출력
  for(int i=0; i<fib.length; i++) {
   System.out.println(fib[i] + " ");
  }
 }
 public static void main(String[] args) {
  if (args.length < 1) {
   System.out.println("Usage : java FiboWithQueue number");
   System.exit(1);
  }
  int n = Integer.parseInt(args[0]);
  FiboWithQueue f = new FiboWithQueue();
  f.fibo(n);
 }
}

 

[출처] 오라클자바커뮤니티 - http://www.oraclejavacommunity.co.kr/bbs/board.php?bo_table=LecJavaAlgorithm&wr_id=90

평일주간[100%환급과정] (8/04)C#4.0,WinForm,ADO.NET (8/04)자바기초JDBC,Servlet/JSP까지 (8/04)Spring,MyBatis,Hibernate실무과정 (8/11)PL/SQL,ORACLE HINT,TUNING (8/11)SQL기초에서 Schema Object까지 (8/11)안드로이드개발자과정 (8/11)채용예정교육 평일야간[개인80%환급] (7/29)안드로이드개발자과정 (7/29)Spring3.X, MyBatis, Hibernate (8/04)웹퍼블리싱 마스터 (8/05)JSP,jQUERY,Spring,MyBatis (8/08)C#,Network,ADO.NET,ASP.NET (8/11)SQL기초에서실무까지 (8/28)자바JSP,jQuery,Spring,MyBatis 주말주간[개인80%환급] (8/02)Spring3.X, MyBatis, Hibernate (8/02)C#,ASP.NET마스터 (8/02)웹퍼블리싱 마스터 (8/02)SQL초보에서 Schema Object까지 (8/09)SQL기초에서실무까지 (8/09)안드로이드개발자과정 (8/09)자바JSP,Ajax,jQuery,Spring,MyBatis (8/23)JAVA,Network&WEB&Framework 주말야간[개인80%환급](18:30~22:20) (8/02)JAVA,Network&WEB&Framework (8/09)SQL기초에서실무까지