Advertisement
Guest User

Untitled

a guest
Aug 19th, 2015
256
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.08 KB | None | 0 0
  1. #include "Lista.h"
  2. #include <iostream>
  3. using namespace std;
  4.  
  5. Lista::Lista()
  6. {
  7. First = 0;
  8. }
  9.  
  10. Lista::~Lista()
  11. {
  12. }
  13.  
  14. Node::Node()
  15. {
  16. Next = 0;
  17. }
  18.  
  19. void Lista::Insert(int k)
  20. {
  21. if (First == 0)
  22. {
  23. First = new Node;
  24. First->key = k;
  25. }
  26. else
  27. {
  28. Node * Tmp = First;
  29. while (Tmp->Next)
  30. {
  31. Tmp = Tmp->Next;
  32. }
  33. Tmp->Next = new Node;
  34. Tmp->Next->key = k;
  35. Tmp->Next->Next = 0;
  36. }
  37. }
  38. void Lista::Print()
  39. {
  40. Node * Tmp = First;
  41. while (Tmp)
  42. {
  43. cout << Tmp->key << endl;
  44. Tmp = Tmp->Next;
  45. }
  46. }
  47. Node * Lista::Search(int k)
  48. {
  49. Node * Tmp = First;
  50. while (Tmp)
  51. {
  52. if (Tmp->key == k)
  53. {
  54. cout << "Found! "<< k << endl;
  55. return Tmp;
  56. }
  57. Tmp = Tmp->Next;
  58. }
  59. cout << "Not Found!" << endl;
  60.  
  61.  
  62. }
  63. void Lista::Delete(int k)
  64. {
  65. if (First->key == k)
  66. {
  67. Node * Tmp = First;
  68. First = First->Next;
  69. delete Tmp;
  70. }
  71. else
  72. {
  73. Node * Tmp = First;
  74. while (Tmp->Next)
  75. {
  76. if (Tmp->key == k-1)
  77. {
  78.  
  79. //Tmp->Next = Tmp->Next->Next;
  80. Tmp = Tmp->Next;
  81.  
  82.  
  83. return;
  84. }
  85. Tmp = Tmp->Next;
  86. }
  87. }
  88. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement