snipt

Ctrl+h for KB shortcuts

C++

stog_pokazivaci.h

#include <iostream>

using namespace std;

struct roba{
int dan,mj,god;
string vrsta,model,boja;
char sifra[9];
float cijena;
};

struct st{
roba data;
st *next;
};


roba TopS(st S){
st *novi = S.next;
return novi->data;
}

void PushS(roba x, st &S){
st *node = new st;
node->data = x;
node->next = S.next;
S.next = node;
}

void PopS(st &S){
if(S.next == NULL) return;
else{
st *node = S.next;
S.next = node->next;
delete node;
}
}

void InitS(st &S){
S.next = NULL;
}

bool IsEmptyS(st S){
if(S.next == NULL) return true;
else return false;
}
https://snipt.net/embed/57468c8e2d87a6cadd874133e5daeb04/
/raw/57468c8e2d87a6cadd874133e5daeb04/
57468c8e2d87a6cadd874133e5daeb04
cpp
C++
46
2019-06-18T09:22:04
True
False
False
/api/public/snipt/96360/
stog_pokazivacih-2
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10">10</a> <a href="#L-11">11</a> <a href="#L-12">12</a> <a href="#L-13">13</a> <a href="#L-14">14</a> <a href="#L-15">15</a> <a href="#L-16">16</a> <a href="#L-17">17</a> <a href="#L-18">18</a> <a href="#L-19">19</a> <a href="#L-20">20</a> <a href="#L-21">21</a> <a href="#L-22">22</a> <a href="#L-23">23</a> <a href="#L-24">24</a> <a href="#L-25">25</a> <a href="#L-26">26</a> <a href="#L-27">27</a> <a href="#L-28">28</a> <a href="#L-29">29</a> <a href="#L-30">30</a> <a href="#L-31">31</a> <a href="#L-32">32</a> <a href="#L-33">33</a> <a href="#L-34">34</a> <a href="#L-35">35</a> <a href="#L-36">36</a> <a href="#L-37">37</a> <a href="#L-38">38</a> <a href="#L-39">39</a> <a href="#L-40">40</a> <a href="#L-41">41</a> <a href="#L-42">42</a> <a href="#L-43">43</a> <a href="#L-44">44</a> <a href="#L-45">45</a> <a href="#L-46">46</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp"></span> </span><span id="L-2"><a name="L-2"></a> </span><span id="L-3"><a name="L-3"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-4"><a name="L-4"></a> </span><span id="L-5"><a name="L-5"></a><span class="k">struct</span> <span class="n">roba</span><span class="p">{</span> </span><span id="L-6"><a name="L-6"></a><span class="kt">int</span> <span class="n">dan</span><span class="p">,</span><span class="n">mj</span><span class="p">,</span><span class="n">god</span><span class="p">;</span> </span><span id="L-7"><a name="L-7"></a><span class="n">string</span> <span class="n">vrsta</span><span class="p">,</span><span class="n">model</span><span class="p">,</span><span class="n">boja</span><span class="p">;</span> </span><span id="L-8"><a name="L-8"></a><span class="kt">char</span> <span class="n">sifra</span><span class="p">[</span><span class="mi">9</span><span class="p">];</span> </span><span id="L-9"><a name="L-9"></a><span class="kt">float</span> <span class="n">cijena</span><span class="p">;</span> </span><span id="L-10"><a name="L-10"></a><span class="p">};</span> </span><span id="L-11"><a name="L-11"></a> </span><span id="L-12"><a name="L-12"></a><span class="k">struct</span> <span class="n">st</span><span class="p">{</span> </span><span id="L-13"><a name="L-13"></a><span class="n">roba</span> <span class="n">data</span><span class="p">;</span> </span><span id="L-14"><a name="L-14"></a><span class="n">st</span> <span class="o">*</span><span class="n">next</span><span class="p">;</span> </span><span id="L-15"><a name="L-15"></a><span class="p">};</span> </span><span id="L-16"><a name="L-16"></a> </span><span id="L-17"><a name="L-17"></a> </span><span id="L-18"><a name="L-18"></a><span class="n">roba</span> <span class="nf">TopS</span><span class="p">(</span><span class="n">st</span> <span class="n">S</span><span class="p">){</span> </span><span id="L-19"><a name="L-19"></a><span class="n">st</span> <span class="o">*</span><span class="n">novi</span> <span class="o">=</span> <span class="n">S</span><span class="p">.</span><span class="n">next</span><span class="p">;</span> </span><span id="L-20"><a name="L-20"></a><span class="k">return</span> <span class="n">novi</span><span class="o">-&gt;</span><span class="n">data</span><span class="p">;</span> </span><span id="L-21"><a name="L-21"></a><span class="p">}</span> </span><span id="L-22"><a name="L-22"></a> </span><span id="L-23"><a name="L-23"></a><span class="kt">void</span> <span class="nf">PushS</span><span class="p">(</span><span class="n">roba</span> <span class="n">x</span><span class="p">,</span> <span class="n">st</span> <span class="o">&amp;</span><span class="n">S</span><span class="p">){</span> </span><span id="L-24"><a name="L-24"></a><span class="n">st</span> <span class="o">*</span><span class="n">node</span> <span class="o">=</span> <span class="k">new</span> <span class="n">st</span><span class="p">;</span> </span><span id="L-25"><a name="L-25"></a><span class="n">node</span><span class="o">-&gt;</span><span class="n">data</span> <span class="o">=</span> <span class="n">x</span><span class="p">;</span> </span><span id="L-26"><a name="L-26"></a><span class="n">node</span><span class="o">-&gt;</span><span class="n">next</span> <span class="o">=</span> <span class="n">S</span><span class="p">.</span><span class="n">next</span><span class="p">;</span> </span><span id="L-27"><a name="L-27"></a><span class="n">S</span><span class="p">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">node</span><span class="p">;</span> </span><span id="L-28"><a name="L-28"></a><span class="p">}</span> </span><span id="L-29"><a name="L-29"></a> </span><span id="L-30"><a name="L-30"></a><span class="kt">void</span> <span class="nf">PopS</span><span class="p">(</span><span class="n">st</span> <span class="o">&amp;</span><span class="n">S</span><span class="p">){</span> </span><span id="L-31"><a name="L-31"></a><span class="k">if</span><span class="p">(</span><span class="n">S</span><span class="p">.</span><span class="n">next</span> <span class="o">==</span> <span class="nb">NULL</span><span class="p">)</span> <span class="k">return</span><span class="p">;</span> </span><span id="L-32"><a name="L-32"></a><span class="k">else</span><span class="p">{</span> </span><span id="L-33"><a name="L-33"></a><span class="n">st</span> <span class="o">*</span><span class="n">node</span> <span class="o">=</span> <span class="n">S</span><span class="p">.</span><span class="n">next</span><span class="p">;</span> </span><span id="L-34"><a name="L-34"></a><span class="n">S</span><span class="p">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">node</span><span class="o">-&gt;</span><span class="n">next</span><span class="p">;</span> </span><span id="L-35"><a name="L-35"></a><span class="k">delete</span> <span class="n">node</span><span class="p">;</span> </span><span id="L-36"><a name="L-36"></a><span class="p">}</span> </span><span id="L-37"><a name="L-37"></a><span class="p">}</span> </span><span id="L-38"><a name="L-38"></a> </span><span id="L-39"><a name="L-39"></a><span class="kt">void</span> <span class="nf">InitS</span><span class="p">(</span><span class="n">st</span> <span class="o">&amp;</span><span class="n">S</span><span class="p">){</span> </span><span id="L-40"><a name="L-40"></a><span class="n">S</span><span class="p">.</span><span class="n">next</span> <span class="o">=</span> <span class="nb">NULL</span><span class="p">;</span> </span><span id="L-41"><a name="L-41"></a><span class="p">}</span> </span><span id="L-42"><a name="L-42"></a> </span><span id="L-43"><a name="L-43"></a><span class="kt">bool</span> <span class="nf">IsEmptyS</span><span class="p">(</span><span class="n">st</span> <span class="n">S</span><span class="p">){</span> </span><span id="L-44"><a name="L-44"></a><span class="k">if</span><span class="p">(</span><span class="n">S</span><span class="p">.</span><span class="n">next</span> <span class="o">==</span> <span class="nb">NULL</span><span class="p">)</span> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-45"><a name="L-45"></a><span class="k">else</span> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span> </span><span id="L-46"><a name="L-46"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
podataka, pokazivaci, stog, strukture, zadatak