Memorandum public override string string Node while null return public void bool false Node while null null true while public void Node new

Transcription

1 Memorandum public override string ToString() string s = ""; while (current!= null) s += current.element.tostring() + ", "; current = current.next; return s; //ToString() public void Sort() T temp; bool isswapped = false; do isswapped = false; while (current!= null && current.next!= null) if (current.element.compareto(current.next.element) > 0) temp = current.element; current.element = current.next.element; current.next.element = temp; isswapped = true; current = current.next; while (isswapped); //SortByElements public void Push(T item) Node newnode = new Node(item); if (this.head == null) this.head = newnode; newnode.next = head; head = newnode; count++; //Push public T Pop() if (head.next!= null) head = head.next; count--; return current.element; //Pop public T Peek() return head.element; //Peek public void Clear() this.head = null; this.count = 0; //Clear 1

2 1.2.5 public bool Contains(T item) while (current!= null) if (object.equals(current.element, item)) return true; current = current.next; return false; //Contains 1.3 static void Main(string[] args) StreamReader rdr = new StreamReader("CStack.cs"); string s = rdr.readtoend(); rdr.close(); Stack<int> stack = new Stack<int>(); bool correctbrackets = true; for (int i = 0; i < s.length; i++) char ch = s[i]; if (ch == '') stack.push(i); if (ch == '') if (stack.count == 0) //Can't pop if the stack is empty correctbrackets = false; break; stack.pop(); if (stack.count!= 0) correctbrackets = false; Console.WriteLine("Are the brackets correct? " + correctbrackets); 2. static void Main(string[] args) StreamReader rdr = new StreamReader("JEMR.txt"); string input = rdr.readtoend(); rdr.close(); Console.WriteLine("Repeating words:"); string pattern foreach (Match match in Regex.Matches(input, pattern, RegexOptions.IgnoreCase)) Console.WriteLine("0 at position 1", match.value, match.index); Console.Write("\nPress any key to exit..."); //Main 2

3 In-order (left, root, right) : 1, 2, 3, 4, 5, 6, 7, 8, 9 Pre-order (root, left, right): 5, 1, 3, 2, 4, 8, 6, 7, 9 Post-order (left, right, root): 2, 4, 3, 1, 7, 6, 9, 8, 5 Breadth-first: 5, 1, 8, 3, 6, 9, 2, 4, public void PrintTreeDFS() PrintTreeDFS(this.Root); Console.WriteLine(); private void PrintTreeDFS(Node node) if (node!= null) PrintTreeDFS(node.Left); Console.Write(node.Value + " "); PrintTreeDFS(node.Right); //PrintTreeDFS 3.4 public void PrintTreeBFS() Queue<Node> Q = new Queue<Node>(); Q.Enqueue(Root); while (Q.Count > 0) Node node = Q.Dequeue(); Console.Write(node.Value + " "); if (node.left!= null) Q.Enqueue(node.Left); if (node.right!= null) Q.Enqueue(node.Right); //PrintTreeBFS 3.5 private Node Find(dynamic value) Node node = this.root; while (node!= null) int compareto = value.compareto(node.value); if (compareto < 0) node = node.left; if (compareto > 0) node = node.right; break; //while return node; //Find public bool Contains(dynamic value) return this.find(value)!= null; //Contains 3

4 4.1 static void Main(string[] args) //Load dictionary Dictionary<string, string> dicpostalcodes = new Dictionary<string, string>(); //Step through file and add entries to dictionary StreamReader f = new StreamReader("PostalCodes.txt"); while (!f.endofstream) string[] s = f.readline().split('\t'); if (dicpostalcodes.containskey(s[0])) dicpostalcodes[s[0]] = dicpostalcodes[s[0]] + ", " + s[1]; dicpostalcodes.add(s[0], s[1]); //while f.close(); //Search for postal code Console.Write("Town: "); string stown = Console.ReadLine(); string scode = ""; if (dicpostalcodes.trygetvalue(stown, out scode)) Console.WriteLine("Postal code(s): " + scode); Console.WriteLine("Town not found."); //Opportunity to read output //Main private int GetHashCode(string Key) int hashcode = 0; for (int i = 0; i < Key.Length; i++) hashcode += (int)key[i]; return hashcode % Capacity; //GetHashCode public void Add(string Key, string Value) int hashcode = GetHashCode(Key); hashtable[hashcode ].Add (new PostalCode(Key, Value) ); //Add public string this [string Key ] get List<PostalCode> postalcodes = hashtable[gethashcode(key)].findall(code => code.town == Key); string s = ""; foreach (PostalCode postalcode in postalcodes) s += postalcode.code + ", "; return s; //get //Indexer 4

5 static void Main(string[] args) HashTable hashtable = new HashTable(100); //Step through file and add entries to hash table StreamReader f = new StreamReader("PostalCodes.txt"); while (!f.endofstream) string[] s = f.readline().split('\t'); hashtable.add(s[0], s[1]); //while f.close(); //Search for postal code Console.Write("Town: "); string stown = Console.ReadLine(); Console.WriteLine(hashTable[sTown]); //Opportunity to read output //Main //class program 5