simple-linked-list: simplify example implementation

exercises/simple-linked-list/src/example/java/SimpleLinkedList.java

 import java.util.NoSuchElementException;
 import java.util.Objects;
 
-public class SimpleLinkedList<T> {
+class SimpleLinkedList<T> {
 
     private static class Element<T> {
 
         final T value;
-        Element next;
+        Element<T> next;
 
         Element(T value) {
             this.value = value;
     private Element<T> head;
     private int size;
 
-    public SimpleLinkedList() {
+    SimpleLinkedList() {
     }
 
-    public SimpleLinkedList(T[] values) {
-        for (int ii = values.length - 1; ii >= 0; ii--) {
-            push(values[ii]);
+    SimpleLinkedList(T[] values) {
+        for (int i = values.length - 1; i >= 0; i--) {
+            push(values[i]);
         }
     }
 
-    public final void push(T value) {
+    final void push(T value) {
         Element<T> newElement = new Element<>(value);
         this.size++;
         if (Objects.isNull(head)) {
         }
     }
 
-    public T pop() {
+    T pop() {
         if (Objects.isNull(head)) {
             throw new NoSuchElementException();
         }
         return value;
     }
 
-    public void reverse() {
+    void reverse() {
         Element<T> current = head;
         Element<T> next;
         Element<T> previous = null;
         head = previous;
     }
 
-    public T[] asArray(Class<T> clazz) {
-        T[] result = newArray(clazz, this.size);
+    T[] asArray(Class<T> clazz) {
+        T[] result = newArray(clazz, size);
         int index = 0;
         Element<T> current = head;
         while (Objects.nonNull(current)) {
         return result;
     }
 
-    private <T> T[] newArray(Class<T> clazz, int size) {
+    private T[] newArray(Class<T> clazz, int size) {
         @SuppressWarnings("unchecked")
         T[] arr = (T[]) Array.newInstance(clazz, size);
 
         return arr;
     }
 
-    public int size() {
+    int size() {
         return this.size;
     }
 }