Triangular numbers with stack replaces recursion : Stack « Collections Data Structure « Java

Home
Java
1.2D Graphics GUI
2.3D
3.Advanced Graphics
4.Ant
5.Apache Common
6.Chart
7.Class
8.Collections Data Structure
9.Data Type
10.Database SQL JDBC
11.Design Pattern
12.Development Class
13.EJB3
14.Email
15.Event
16.File Input Output
17.Game
18.Generics
19.GWT
20.Hibernate
21.I18N
22.J2EE
23.J2ME
24.JavaFX
25.JDK 6
26.JDK 7
27.JNDI LDAP
28.JPA
29.JSP
30.JSTL
31.Language Basics
32.Network Protocol
33.PDF RTF
34.Reflection
35.Regular Expressions
36.Scripting
37.Security
38.Servlets
39.Spring
40.Swing Components
41.Swing JFC
42.SWT JFace Eclipse
43.Threads
44.Tiny Application
45.Velocity
46.Web Services SOA
47.XML
Java » Collections Data Structure » Stack 




Triangular numbers with stack replaces recursion
Triangular numbers with stack replaces recursion
     
import java.io.IOException;

public class TriangleStack {
  static int num;

  static int ans;

  static Stack theStack;

  public static void main(String[] argsthrows IOException {
    num = 100;
    stackTriangle();
    System.out.println("Triangle=" + ans);
  }

  public static void stackTriangle() {
    theStack = new Stack(10000)// make a stack

    ans = 0// initialize answer

    while (num > 0// until n is 1,
    {
      theStack.push(num)// push value
      --num; // decrement value
    }
    while (!theStack.isEmpty()) // until stack empty,
    {
      int newN = theStack.pop()// pop value,
      ans += newN; // add to answer
    }
  }

}

class Stack {
  private int maxSize; // size of stack array

  private int[] data;

  private int top; // top of stack

  public Stack(int s) {
    maxSize = s;
    data = new int[maxSize];
    top = -1;
  }

  public void push(int p) {
    data[++top= p;
  }

  public int pop() {
    return data[top--];
  }

  public int peek() {
    return data[top];
  }

  public boolean isEmpty() {
    return (top == -1);
  }
}


           
         
    
    
    
    
  














Related examples in the same category
1.Demonstration of Stack ClassDemonstration of Stack Class
2.Stack in java.utilStack in java.util
3.Stack data structureStack data structure
4.Bracket Checker
5.String Reverser Through Stack String Reverser Through Stack
6.Link stackLink stack
7.Triangular numbersTriangular numbers
8.Show String ReversalsShow String Reversals
9.Generic stack demo with annotation
10.Character Stack
11.A faster, smaller stack implementation.
12.Growable Object stack with type specific access methods
13.Growable int stack with type specific access methods
14.Stack for boolean values
15.extends ArrayList to create Stack
16.Growable String stack with type specific access methods.
17.A simple integer based stack.
18.A very simple unsynchronized stack. This one is faster than the java.util-Version.
19.Pop an empty stack ntry times and catch the resulting exceptionPop an empty stack ntry times and catch the resulting exception
20.Object Stack
21.Fast stack
java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.