FileReader fileReader = new FileReader("test.text");
                in = new BufferedReader(fileReader);
                count("presidents.text", in);
            } catch (IOException ioe) {
                ioe.printStackTrace();
            } finally {
                if (in != null) {
                    try {
                        in.close();
                    } catch (IOException ioe) {
                        ioe.printStackTrace();
                    }
 
 
 
 
public static void main(String[] args) {
        // TODO Auto-generated method stub
        // will store the words read from the file
        List<String> wordList = new ArrayList<String>();
 
        BufferedReader br = null;
        try {
        // attempt to open the words file
        br = new BufferedReader( new FileReader( "test.txt" ) );
 
        String word;
 
        // loop and read a line from the file as long as we dont
        //get null
        while( ( word = br.readLine() ) != null )
        // add the read word to the wordList
        wordList.add( word );
        } catch( IOException e ) {
        e.printStackTrace();
        } finally {
        try {
        // attempt the close the file
        br.close();
        } catch( IOException ex ) {
        ex.printStackTrace();
        }
        }
 
        // initialize a new string array equal to the size of the
        //wordList
        String[] words = new String[ wordList.size() ];

// < key = WordLength, value = NumberOfWordsOfThisLength >
Map<Integer,Integer> M = new HashMap<Integer,Integer>();
for(int i=0;i<words.length;++i)
{
  Integer temp = new Integer(words[i].length());
  Integer freq = M.get(temp);
  M.put(temp,(freq == null)? 1 : freq+1);
}

public class DoubleLL{

Node head = null;
Node curr = null;

public class Node{

Node next;
Node prev;

private int order;
private String name;
private int numChars;

public Node()
{next = null; prev = null;}

}

public DoubleLL(){

head = new Node();

}

public void addNode()
{

if(head.next == null)
{
Node newN = new Node();
head.next = newN;
curr = head.next;
head.prev = newN;
}
else
{

Node newN = new Node();
curr.next = newN;
newN.next = head;

}
}

public int getCount()
{

Node front = head;
front = front.next;
int i = 1;

while(front != head)
{

front = front.next;
i ++;

}

return i;

}

public static void main(String [] args)
{

DoubleLL mylist = new DoubleLL();
mylist.addNode();
mylist.addNode();
mylist.addNode();

System.out.println(mylist.getCount());

}

}