2013년 9월 9일 월요일

(자바 스택, 스택괄호, 자바교육입니다.)Stack을 응용한 문자열 뒤집기, 괄호체크 하기 public class ArrayStack implements Stack { int top; // current top of stack Object [] stack; // element array public ArrayStack(int initialCapacity) { if (initialCapacity < 1) throw new IllegalArgumentException ("initialCapacity must be >= 1"); stack = new Object [initialCapacity] ; top = -1; } public ArrayStack() { this(10); } public boolean isEmpty( ) { return top == -1; } public Object peek() { if (isEmpty() ) throw new EmptyStackException(); return stack[top]; } public void push(Object theElement) { // increase array size if necessary if (top == stack.length - 1) ensureCapacity(); // put theElement at the top of the stack stack[++top] = theElement; } public Object pop() { if (isEmpty()) throw new EmptyStackException(); Object topElement = stack[top]; stack[top--] = null; // enable garbage collection return topElement; } private void ensureCapacity() { Object[] larger = new Object[stack.length*2]; for (int index=0; index < stack.length; index++) larger[index] = stack[index]; stack = larger; } public String toString() { if (isEmpty()) return ""; String result = "= 0; i--) result += stack[i] + " "; return result + ">"; } // end toString } public class EmptyStackException extends RuntimeException { public EmptyStackException() { super ("The stack is empty."); } public EmptyStackException (String message) { super (message); } } //Stack을 응용한 문자열 뒤집기, 괄호체크 하기 public class StackApp { public static String reverseString (String str ) { //Create a new stack Stack stk = new ArrayStack(); // push each character into stack for (int i = 0; i < str.length(); i++) { char ch = str.charAt(i); stk.push( new Character(ch)); } String ret=""; for (int i = 0; i < str.length(); i++) { char charFromStack = ((Character)stk.pop()).charValue(); ret = ret + charFromStack; } return ret; } public static boolean bracketsBalance (String exp) { ArrayStack stk = new ArrayStack(exp.length() +1); for (int i = 0; i < exp.length(); i++) { //Scan across the __EXPRESSION__ char ch = exp.charAt(i); if ( ch== '[' || ch == '(' ) { stk.push( new Character(ch)); } else if(ch == ']' || ch == ')') { //empty means brackets unmatched if (stk.isEmpty()) return false; char charFromStack = ((Character)stk.pop()).charValue(); if ( ch == ']' && charFromStack != '[' || (ch == ')' && charFromStack != '(') ) return false; } // end if } // end for loop return stk.isEmpty(); //empty means matched, else unmatched } public static void main(String args[]) { if (args.length < 2) { System.out.println("Usage : java StackApp String1 String2"); System.exit(1); } String s1 = args[0]; String s2 = args[1]; System.out.println(s1 + " : " + reverseString(s1)); if (bracketsBalance(s2)) { System.out.println("괄호가 정확함"); } else { System.out.println("괄호가 부정확 함"); } } } [출처] 오라클자바커뮤니티 - http://www.oraclejavanew.kr/bbs/board.php?bo_table=LecJavaAlgorithm&wr_id=83 오라클자바커뮤니티 추천 실무 강좌 - 개인80%환급 JAVA ORACLE iPhone/Android .NET 표준웹/HTML5 채용/취업무료교육 초보자(재학생)코스 [기업특강]JAVA,JSP,AJAX,jQUERY 총 5일 40시간 09-09 스프링3.X게시판&오라클힌트,SQL튜닝,사례연구 총 4일 32시간 09-10 Spring3.X, MyBatis, Hibernate실무과정 총 5일 35시간 09-24 스프링3.X게시판&오라클힌트,SQL튜닝,사례연구 총 11일 33시간 09-09 Spring3.X, MyBatis, Hibernate실무과정 총 12일 36시간 09-12 자바기초에서JSP,Ajax,jQuery,Spring3.2,MyBatis까지 총 24일 72시간 09-12 JAVA&WEB프레임워크실무과정 총 33일 99시간 09-13 자바초보에서안드로이드까지 총 18일 54시간 09-25 JAVA,JSP 초보에서 실무까지 총 18일 56시간 10-02 자바초보에서안드로이드까지 총 8일 56시간 09-14 Spring3.X, MyBatis, Hibernate실무과정 총 5일 35시간 09-14 자바기초에서JSP,Ajax,jQuery,Spring3.2,MyBatis까지 총 10일 70시간 09-14 MiPlatform, XPlatform 실무강좌 총 5일 35시간 09-28 스프링3.X게시판&오라클힌트,SQL튜닝,사례연구 총 4일 32시간 09-28 JAVA&WEB프레임워크실무과정 총 14일 98시간 09-28

(자바 스택, 스택괄호)Stack을 응용한 문자열 뒤집기, 괄호체크 하기

public class ArrayStack implements Stack   {           
             int top;         // current top of stack
             Object [] stack;   // element array
              
             public ArrayStack(int initialCapacity) {
                  if (initialCapacity < 1)
                  throw new IllegalArgumentException
                                        ("initialCapacity must be >= 1");
                  stack = new Object [initialCapacity] ;
                  top = -1;
             }
     
       public ArrayStack() {
      this(10);
       }
      
       public boolean isEmpty( ) {
          return top == -1;
       }      
       
        public Object peek() {
               if (isEmpty() )
                     throw new EmptyStackException();
               return stack[top];
        }    

       
  public void push(Object theElement) {
    // increase array size if necessary   
    if (top == stack.length - 1) ensureCapacity();
        
            // put theElement at the top of the stack 
            stack[++top] = theElement;
      }

 
     public Object pop() {
            if  (isEmpty())
                  throw new EmptyStackException();
            Object topElement = stack[top];
             stack[top--] = null;   // enable garbage collection
             return topElement;
      }   
   private void ensureCapacity()  {
      Object[] larger = new Object[stack.length*2];
      for (int index=0; index < stack.length; index++)
         larger[index] = stack[index];
      stack = larger;
   }
   public String toString() {
    if (isEmpty())
      return "<empty stack>";
    String result = "<stack :";
    for (int i = top; i >= 0; i--)
      result += stack[i] + " ";
    return result + ">";
  } // end toString
}
 
 
public class EmptyStackException extends RuntimeException {
   public EmptyStackException()   {
      super ("The stack is empty.");
   }
   public EmptyStackException (String message)   {
      super (message);
   }
}
 
//Stack을 응용한 문자열 뒤집기, 괄호체크 하기
public class StackApp {
  public static String reverseString (String str )    {
 //Create a new stack
 Stack stk = new ArrayStack();
 // push each character into stack
 for (int i = 0; i < str.length(); i++)  {
   char ch = str.charAt(i);
   stk.push( new Character(ch));
 } 
 String ret="";
    for (int i = 0; i < str.length(); i++) {
     char charFromStack = ((Character)stk.pop()).charValue();
        ret = ret + charFromStack;
    }
    return ret;
  }
  public static boolean bracketsBalance (String exp) {
    ArrayStack stk = new ArrayStack(exp.length() +1);
    for (int i = 0; i < exp.length(); i++) {
         //Scan across the __EXPRESSION__
         char ch = exp.charAt(i);
         if (  ch== '[' || ch == '('  )  {
            stk.push( new Character(ch));
         }        
   else if(ch == ']' || ch == ')')  { 
    //empty means brackets unmatched
   if (stk.isEmpty())   return false;
   char charFromStack = ((Character)stk.pop()).charValue();
   if (  ch == ']' && charFromStack != '['
     ||  (ch == ')' && charFromStack != '(')  )
     return false;
  } // end if
 } // end for loop
    return stk.isEmpty();  //empty means matched,  else unmatched
}
      
  public static void main(String args[]) {   
      if (args.length < 2)   {
    System.out.println("Usage : java StackApp String1 String2");
    System.exit(1);
      }
   String s1 = args[0];
   String s2 = args[1];
   System.out.println(s1 + " : " + reverseString(s1));
   if (bracketsBalance(s2))  {
    System.out.println("괄호가  정확함");
   }
   else {
    System.out.println("괄호가 부정확 함");
   }  
  }
}

오라클자바커뮤니티 추천 실무 강좌 - 개인80%환급




댓글 없음:

댓글 쓰기