linkedlist/linkedlist.js at master · jjamay/linkedlist · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
var Node = function(val) {
  this.value = val;
  this.next = null;
}

var linkedList = function() {

  this.head;

  this.insert = function(val) {
    if (!this.head) {
      this.head = new Node(val)
    } else {
      var curNode = this.head;
      while(curNode.next) {
        curNode = curNode.next;
      }
      curNode.next = new Node(val);
    }
  }

  this.print = function() {
    var curNode = this.head;
    console.log(curNode.value);
    while(curNode.next) {
      curNode = curNode.next;
      console.log(curNode.value);
    }
  }

  this.search = function(val) {
    var curNode = this.head;
    while(curNode) {
      if (curNode.value == val) {
        return true;
      } else {
        curNode = curNode.next;
      }
    }
    return false;
  }

  this.deleteLast = function() {
    if (this.head) {
      if (this.head.next) {
        curNode = this.head;
        while(curNode.next.next) {
          curNode = curNode.next;
        }
        curNode.next = null;
      } else {
        this.head = null;
      }
    }
  }

  this.deleteFirst = function() {
    if (this.head) {
      if (this.head.next) {
        this.head = this.head.next;
      } else {
        this.head = null;
      }
    }
  }
}

// bonus function
var isPalindrome = function(string) {
  var length = string.length;
  var end = length - 1;
  if (string[0] == string[end]) {
    if (end <= 1) {
      return true;
    } else {
      return isPalindrome(string.substring(1, end - 1));
    }
  } else {
    return false;
  }
}

console.log(isPalindrome("Jordan"));