LinkedList.playground is a playground file which can be opened by Xcode 10.2.1.
For linux, type this into terminal
cd LinkedList.playground/ ; swift Contents.swift
| Node |
|---|
| - value : Int |
| - next : Node? |
| + init(value : Int) -> Void |
| + deinit() -> Void |
| + GetValue() -> Int |
| + SetNext(with Node : Node?) |
| + GetNext() -> Node? |
| Linked List |
|---|
| + head : Node? |
| + Insert(NodeWithValue val : Int) -> Bool |
| + DisplayList() -> Void |
| + Delete(nodeWith Val : Int) -> Bool |
| + Search(forValue Val : Int) -> Bool |
| + Update(Value source : Int, toValue destination : Int) -> Bool |
- Singly Linked List.
- Each node in the Linked List is a node with unique data point.
- The data in the nodes when traversing the linked list are always in ascending order.
Q. Write a code, that would return the name of the super hero corrosponding to the T9 code? eg 0 4855 -> Hulk.
A. Easy and boring way: Create a dictionary od [String : String], with T9 as the key, and name as the value. Refer AvengersDictionary
Interesting Way : Create a tree which will always be 8 or less node wide, and will be as tall as the longest name. Use huristic to save and retrive the Hero node.
Each node is an object of String and a Dictionary [String : Node], with String being the character from the T9 code or Hero.
All the red nodes have a hero node, that corrosponds to the rudimentary huristic, for eg: Hulk is 0 4855, so the first red Node "5" will have a node at Dictionary[22], (4 + 8 + 5 + 5 = 22). Here are all the nodes corrosponding to red nodes from top to bottom
Height 4:
5: "HULK"
7: "THOR"
Height 5:
3: "BLADE"
4: "FLASH"
6: "ROBIN"
Height 6:
6: "BATMAN"
Height 7:
6: "IRONMAN" & "PHANTOM" \\Hence the huristic
9: "HELLBOY"
Height 8:
6: "SUPERMAN"
7: "PUNISHER"
Height 9:
6: "SPIDERMAN"
3: "WOLVERINE"
Height 10:
7: "GHOSTRIDER"
9: "BLACKWIDOW"
Height 12:
7: "ANNAWILLIAMS"
Height 14:
2: "CAPTAINAMERICA"
Further improvement possibilities,
- Use alphabetic nodes
- Use a better huristic than just addition
- Possibly using single height tree with good huristic, or a compact digest algoithm to refer to leaf nodes.