trangleProble switch方法 java

 public class trangleProblem {
 
     static int res=1;
     int codePart=1;
     int n=100;
     Stack<Param> stack=new Stack<Param>();
     public static void main(String[] args) {
         trangleProblem tb=new trangleProblem();
         while(tb.solve()==false)
             ;
     }
 
     public boolean solve()
     {
 
         switch(codePart)
         {
         case 1:stack.push(new Param(n, 6));
                 codePart=2;
                 break;
         case 2:
                 if(stack.peek().nn==1)
                     codePart=5;
                 else
                     codePart=3;
                 break;
         case 3: stack.push(new Param(stack.peek().nn-1, 4));
                 codePart=2;
                 break;
         case 4:res+=stack.peek().nn;
                codePart=5;
                 break;
         case 5: codePart=stack.peek().returnAddress;
                 stack.pop();
                 break;
         case 6:
                 return true;
 
         }
         return false;
     }
 
 }
 class Param
 {
     int nn;
     int returnAddress;
      Param(int nn,int returnAddress)
     {
         this.nn=nn;
         this.returnAddress=returnAddress;
     }
 }