Originariamente Scritto da
Bl@ck
mi annoio a lavoro, non c'è manco rick per flammare e vojo tornare a casa per vedermi lovely complex :(
Guarda Black, sto studiando 
Codice:
/*
* Pila.c
*
* Created on: 10-giu-2009
* Author: Lele
*/
#include <stdio.h>
#include "Pila.h"
int main(){
SPTR pila;
pila = create(10);
printf("Stack head: %d\n", head(pila));
pila = push(5,pila);
printf("Stack head: %d\n", pop(&pila));
printf("Stack head: %d\n", head(pila));
printf("Stack head: %d\n", pop(&pila));
printf("Stack head: %d\n", pop(&pila));
return 0;
}
Codice:
/*
* Pila.h
*
* Created on: 10-giu-2009
* Author: Lele
*/
#include <stdlib.h>
typedef struct stack {
int elem;
struct stack *next;
} STACK, *SPTR;
SPTR create(int);
SPTR push(int, SPTR);
int pop(SPTR*);
int isEmpty(SPTR);
int head(SPTR);
SPTR create(int e){
SPTR temp = malloc(sizeof(STACK));
temp->elem = e;
temp->next = NULL;
return temp;
}
SPTR push(int e, SPTR p) {
SPTR temp = malloc(sizeof(STACK));
temp->elem = e;
temp->next = p;
return temp;
}
int pop(SPTR* p){
SPTR temp;
if(!isEmpty(*p)) {
int n = (*p)->elem;
temp = *p;
*p = (*p)->next;
free(temp);
return n;
}
return -1;
}
int isEmpty(SPTR p){
return (p == NULL) ? 1 : 0;
}
int head(SPTR p) {
return p->elem;
}
Codice:
/*
* Coda.c
*
* Created on: 10-giu-2009
* Author: Lele
*/
#include <stdio.h>
#include "Coda.h"
int main(){
QPTR coda;
coda = create(10);
printf("Queue head: %d\n", head(coda));
coda = queue(5,coda);
coda = queue(3,coda);
printf("Queue head: %d\n", dequeue(&coda));
printf("Queue head: %d\n", head(coda));
printf("Queue head: %d\n", dequeue(&coda));
printf("Queue head: %d\n", dequeue(&coda));
return 0;
}
Codice:
/*
* Coda.h
*
* Created on: 10-giu-2009
* Author: Lele
*/
#include <stdlib.h>
typedef struct queue {
int elem;
struct queue *next;
} QUEUE, *QPTR;
QPTR create(int);
QPTR queue(int, QPTR);
int dequeue(QPTR*);
int isEmpty(QPTR);
int head(QPTR);
QPTR create(int e){
QPTR temp = malloc(sizeof(QUEUE));
temp->elem = e;
temp->next = NULL;
return temp;
}
QPTR queue(int e, QPTR p) {
QPTR temp1, temp2;
temp1 = malloc(sizeof(QUEUE));
temp1->elem = e;
temp1->next = NULL;
temp2 = p;
while(temp2->next != NULL) temp2 = temp2->next;
temp2->next = temp1;
return p;
}
int dequeue(QPTR* p){
QPTR temp;
if(!isEmpty(*p)) {
int n = (*p)->elem;
temp = *p;
*p = (*p)->next;
free(temp);
return n;
}
return -1;
}
int isEmpty(QPTR p){
return (p == NULL) ? 1 : 0;
}
int head(QPTR p) {
return p->elem;
}
Ora dovrei fare gli alberi. Novoja.
Riferimento: [Circolino] Puru puru pururin ~ Kore wa Inbou da! [NIPPON NERDS INSAID]
