Advertisement
Guest User

Untitled

a guest
Jun 20th, 2019
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.14 KB | None | 0 0
  1. #include <iostream>
  2. #include <list>
  3. #include <complex>
  4. #include <iterator>
  5. struct Kompleksni
  6. {
  7. double re,im;
  8. Kompleksni *sljedeci;
  9. };
  10.  
  11. Kompleksni *KreirajListu(std::list<std::complex<double>> lista)
  12. {
  13. Kompleksni *pocetak=nullptr,*prethodni;
  14. auto it=lista.begin();
  15. for(int i=0;i<lista.size();i++)
  16. {
  17. Kompleksni *novi=new Kompleksni{it->real(),it->imag(),nullptr};
  18. if(!pocetak) pocetak=novi;
  19. else prethodni->sljedeci=novi;
  20. prethodni=novi;
  21. it++;
  22. }
  23. return pocetak;
  24. }
  25. void ObrisiListu(Kompleksni *poc)
  26. {
  27. Kompleksni *temp,*p=poc;
  28. while(p!=nullptr)
  29. {
  30. temp=p->sljedeci;
  31. delete p;
  32. p=temp;
  33. }
  34. }
  35. int main()
  36. {
  37.  
  38. std::complex<double>c(2,2);
  39. std::complex<double>c1(1,5);
  40. std::complex<double>c2(4,5);
  41. std::list<std::complex<double>>lista;
  42. lista.push_back(c);
  43. lista.push_back(c1);
  44. lista.push_back(c2);
  45. auto k=KreirajListu(lista);
  46. for(auto p=k;p!=nullptr;p=p->sljedeci)
  47. {
  48. std::cout<<p->re<<" "<<p->im<<std::endl;
  49. }
  50. ObrisiListu(k);
  51.  
  52.  
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement