SingleLinkList

class Node<T: Equatable> {
  var value: T? = nil
  var next: Node? = nil
}

class LinkedList<T: Equatable> {
  var head = Node<T>()
  
  
  func insert(value: T) {
  //find to see if empty list
  if self.head.value == nil {
    self.head.value = value
  } else {
    //find the last node without a next value
    var lastNode = self.head
    while lastNode.next != nil {
      lastNode = lastNode.next!
    }
    //once found, create a new node and connect the linked list
    let newNode = Node<T>()
    newNode.value = value
    lastNode.next = newNode
  }
  
  }
   func reverse()
  {
   var currentNode: Node! = self.head
 //var currentNode = head; 
 var previousNode = Node<T>()
      var nextNode  = Node<T>()
       
        while currentNode.next != nil {
        print("ffff \(currentNode.value)")
        nextNode = currentNode.next!
        currentNode.next = previousNode
        
        previousNode = currentNode
        currentNode = nextNode
        }
         //self.head = currentNode.next!
       
        
        head = previousNode;
        if currentNode.next == nil
        {
           self.head  = currentNode
        }

      
  }
  func remove(value: T) {
  //Check if the value is at the head
  if self.head.value == value {
    self.head = self.head.next!
  }
//Traverse the linked list to see if node is in the linked list
if self.head.value != nil {
    var node = self.head
    var previousNode = Node<T>()
    //If value found, exit the loop
    while node.value != value && node.next != nil {
      previousNode = node
      node = node.next!
    }
    //once found, connect the previous node to the current node's next
    if node.value == value {
      if node.next != nil {
        previousNode.next = node.next
      } else {
        //if at the end, the next is nil 
        previousNode.next = nil
      }
    }
  }
}

func printAllKeys() {
  var current: Node! = self.head
  print("---------------")
  while current != nil && current.value != nil {
    print("The item is \(current.value!)")
    current = current.next
  }
}
  
  
}


var myList = LinkedList<Int>()
myList.insert(value:100)
myList.insert(value:200)
myList.insert(value:300)
myList.insert(value:400)
myList.insert(value:500)
//myList.remove(value:100)
myList.printAllKeys()
myList.reverse()
myList.printAllKeys()