Count size of the list

Author: gil-son

DataStructures/courses/LoianeGroner/datastructure-algorithms-java/src/com/loiane/datastructure/list/LinkedList.java

@@ -3,12 +3,19 @@
 public class LinkedList<T> {
 
 	private Node<T> begin;
+	private int size = 0;
 
-	public void add(T element) {
+	public void addFirst(T element) {
 		Node<T> cell = new Node<T>(element);
 		this.begin = cell;
+		this.size++;
 	}
 
+	public void addSequence(T element) {
+		Node<T> cell = new Node<T>(element, begin);
+		this.begin = cell;
+		this.size++;
+	}
 
 	@Override
 	public String toString() {
@@ -17,4 +24,8 @@ public String toString() {
 		return builder.toString();
 	}
 
+	public int getSize() {
+		return this.size;
+	}
+	
 }

DataStructures/courses/LoianeGroner/datastructure-algorithms-java/src/com/loiane/datastructure/list/test/LinkedListTest.java

@@ -7,8 +7,11 @@ public class LinkedListTest {
 	public static void main(String[] args) {
 
 		LinkedList<Integer> list = new LinkedList<>();
-		list.add(1);
+		list.addFirst(1);
+		list.addSequence(2);
+		list.addSequence(3);
 
+		System.out.println("Size: "+list.getSize());
 		System.out.println(list);
 	}
 }