Advertisement
Guest User

Untitled

a guest
Nov 22nd, 2017
61
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.16 KB | None | 0 0
  1. package ktiElementSaKrajaListe;
  2.  
  3.  
  4.  
  5. public class JednostrukaLista<T> {
  6.  
  7. private class Cvor<T> {
  8. private T info;
  9. private Cvor<T> next;
  10.  
  11. public Cvor(T info,Cvor<T> next) {
  12. super();
  13. this.info=info;
  14. this.next=next;
  15. }
  16.  
  17. public T getInfo() {
  18. return info;
  19. }
  20.  
  21. public void setInfo(T info) {
  22. this.info = info;
  23. }
  24.  
  25. public Cvor<T> getNext() {
  26. return next;
  27. }
  28.  
  29. public void setNext(Cvor<T> next) {
  30. this.next = next;
  31. }
  32.  
  33. }
  34.  
  35. private Cvor<T> head;
  36.  
  37. public Cvor<T> getHead() {
  38. return head;
  39. }
  40.  
  41. public void setHead(Cvor<T> head) {
  42. this.head = head;
  43. }
  44.  
  45. public JednostrukaLista() {
  46. head=null;
  47. }
  48.  
  49. public boolean dodajNaPocetak(T info) {
  50. if(info == null) {
  51. return false;
  52. }
  53. head = new Cvor<T>(info,head);
  54. return true;
  55. }
  56.  
  57. public boolean dodajNaKraj(T info) {
  58. if(info == null) {
  59. return false;
  60. }
  61.  
  62. if(head == null) {
  63. return dodajNaPocetak(info);
  64. }
  65.  
  66. Cvor<T> tmp = head;
  67.  
  68. while(tmp.next != null) {
  69. tmp = tmp.next;
  70. }
  71.  
  72. tmp.next = new Cvor<T>(info, null);
  73. return true;
  74. }
  75.  
  76. public boolean dodajPre(T info,T key) {
  77. if(info == null) {
  78. return false;
  79. }
  80. Cvor<T> tmp = head;
  81. if(head.info.equals(key)) {
  82. return dodajNaPocetak(info);
  83. }
  84. while(tmp.next != null && !tmp.next.info.equals(key)) {
  85. tmp = tmp.next;
  86. }
  87. if(tmp.next == null) {
  88. return false;
  89. }
  90. tmp.next =new Cvor<T>(info,tmp.next);
  91. return true;
  92. }
  93.  
  94. public boolean dodajPosle(T info,T key) {
  95. if(info == null) {
  96. return false;
  97. }
  98. Cvor<T> tmp = head;
  99. while(tmp != null && !tmp.info.equals(key)) {
  100. tmp = tmp.next;
  101. }
  102. if(tmp == null) {
  103. return false;
  104. }
  105. tmp.next = new Cvor<T>(info, tmp.next);
  106. return true;
  107. }
  108.  
  109. public void ispisiListu() {
  110. if(head == null) {
  111. System.out.println("Lista je prazna");
  112. return;
  113. }
  114. Cvor<T> tmp = head;
  115. while(tmp != null) {
  116. System.out.print(tmp.info);
  117. if(tmp.next != null) {
  118. System.out.print(" -> ");
  119. }
  120. else {
  121. System.out.println();
  122. }
  123. tmp = tmp.next;
  124. }
  125. }
  126.  
  127. public boolean Izbrisi(T key) {
  128. if(head == null || key == null) {
  129. return false;
  130. }
  131. if(head.info.equals(key)) {
  132. head = head.next;
  133. }
  134. Cvor<T> tmp = head;
  135. while(tmp.next != null && tmp.next.info.equals(key)) {
  136. tmp = tmp.next;
  137. }
  138. if(tmp.next == null)
  139. {
  140. return false;
  141. }
  142. tmp.next = tmp.next.next;
  143. return true;
  144. }
  145.  
  146. public void Invertuj() {
  147. if(head == null || head.next == null) {
  148. return ;
  149. }
  150. Cvor<T> first = null;
  151. Cvor<T> second = head;
  152. while(second != null) {
  153. Cvor<T> third = second.next;
  154. second.next = first;
  155. first = second;
  156. second = third;
  157. }
  158. head = first;
  159. }
  160.  
  161. public int ktiElementSaKrajaListe(JednostrukaLista<Integer> lista, int k) {
  162. Cvor<Integer> tmp = lista.getHead();
  163.  
  164.  
  165. }
  166.  
  167. public static void main(String[] args) {
  168. JednostrukaLista<Integer> lista = new JednostrukaLista<>();
  169. lista.dodajNaKraj(5);
  170. lista.dodajNaKraj(4);
  171. lista.dodajNaKraj(2);
  172. lista.dodajNaKraj(1);
  173. lista.dodajNaKraj(8);
  174. lista.dodajNaKraj(6);
  175. lista.dodajNaKraj(10);
  176. lista.ispisiListu();
  177.  
  178. }
  179. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement