#include <iostream>
using namespace std;
int licznikjebany =0;
struct node{
node *next;
int val;
};
void delfirst(node*&head);
void usunwieksze(node*&head,int odczego)
{
node*temp=head;
node*temp2;
while (temp != NULL && temp->val > odczego) {
head = temp->next;
delete temp;
temp = head;
}
while(temp!=NULL)
{
while(temp!=NULL &&temp->val <=odczego)
{
temp2=temp;
temp=temp->next;
}
if(temp==NULL)
return;
temp2->next=temp->next;
delete temp;
temp=temp2->next;
}
}
void add(node *&head,int x)
{
licznikjebany++;
node *temp=new node;
temp->val=x;
temp->next=head;
head=temp;
}
void addtosorted(node *&head,int x)
{
licznikjebany++;
add(head,NULL);
node *temp2=head;
while((temp2->next!=NULL) && (temp2->next->val<x))
{
temp2=temp2->next;
}
//dodawanie nody
node *temp = new node;
temp->val=x;
temp->next=temp2->next;
temp2->next=temp;
delfirst(head);
}
node* split(node *&head)
{
if(head==NULL)
return NULL;
node *temp=head;
node *temp2=head->next;
while(temp2!=NULL)
{
temp2=temp2->next;
if(temp2==NULL)
break;
temp2=temp2->next;
temp=temp->next;
}
node *dozwrocenia= temp->next;
temp->next=NULL;
return dozwrocenia;
}
//void polacz(node *&head,node*&head2)
//{
//}
void show(node *head)
{
node *temp=head;
while(temp!=NULL)
{
cout<<temp->val<<"-->";
temp=temp->next;
}
}
void maxi(node *head)
{
node *temp=head;
node *temp2=head;
while(temp !=NULL)
{
if(temp2->val < temp->val)
{
temp2=temp;
}
temp=temp->next;
}
cout<<temp2->val;
}
void delfirst(node*&head)
{
if(head!=NULL)
{
licznikjebany--;
node *temp=head;
head=temp->next;
delete temp;
}
}
void usunx2(node *&head)
{
if(head!=NULL)
{
node *temp=head;
node *temp2=head->next;
while(temp!=NULL && temp2!=NULL)
{
temp->next=temp2->next;
delete temp2;
temp=temp->next;
if(temp!=NULL)
{
temp2=temp->next;
}
}
}
}
int srednia(node*head)
{
int iloscob=0;
int dodajemy=0;
if(head==NULL)
return 0;
node *temp=head;
while(temp)
{
dodajemy=dodajemy+temp->val;
temp=temp->next;
iloscob++;
}
return dodajemy/iloscob;
}
void addxx(node*&head)
{
node *temp=new node;
temp=head;
while(temp!=NULL)
{
add(temp->next,temp->val);
temp=temp->next->next;
}
}
void addpoval(node*&head)
{
node *temp=new node;
temp=head;
while(temp!=NULL)
{
for(int i=0;i<temp->val-1;i++)
{
add(temp->next,temp->val);
temp=temp->next;
}
temp=temp->next;
}
}
int main()
{
node *head=NULL;
//delfirst(head);
show(head);
cout<<endl<<"wywolanie"<<endl;
addtosorted(head,3);
addtosorted(head,1);
addtosorted(head,3);
addtosorted(head,-2);
addtosorted(head,5);
node* head2=split(head);
//addpoval(head);
// usunx2(head);
cout<<licznikjebany<<endl;
show(head);
//addxx(head);
return 0;
}
{"html5":"htmlmixed","css":"css","javascript":"javascript","php":"php","python":"python","ruby":"ruby","lua":"text\/x-lua","bash":"text\/x-sh","go":"go","c":"text\/x-csrc","cpp":"text\/x-c++src","diff":"diff","latex":"stex","sql":"sql","xml":"xml","apl":"apl","asterisk":"asterisk","c_loadrunner":"text\/x-csrc","c_mac":"text\/x-csrc","coffeescript":"text\/x-coffeescript","csharp":"text\/x-csharp","d":"d","ecmascript":"javascript","erlang":"erlang","groovy":"text\/x-groovy","haskell":"text\/x-haskell","haxe":"text\/x-haxe","html4strict":"htmlmixed","java":"text\/x-java","java5":"text\/x-java","jquery":"javascript","mirc":"mirc","mysql":"sql","ocaml":"text\/x-ocaml","pascal":"text\/x-pascal","perl":"perl","perl6":"perl","plsql":"sql","properties":"text\/x-properties","q":"text\/x-q","scala":"scala","scheme":"text\/x-scheme","tcl":"text\/x-tcl","vb":"text\/x-vb","verilog":"text\/x-verilog","yaml":"text\/x-yaml","z80":"text\/x-z80"}