Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- /*
- * add_anfang
- * ausgabe
- * delete
- * einlesen
- * modded delete
- */
- struct myItem {
- int data;
- struct myItem *next;
- };
- struct myItem* add_anfang(struct myItem *item, int data){
- struct myItem *new_item = malloc(sizeof(struct myItem));
- new_item->data = data;
- new_item->next = item;
- return new_item;
- }
- void ausgabe(struct myItem *item){
- if(item != NULL){
- do{
- printf("%i\n", item->data);
- item = item->next;
- }while(item != NULL);
- }
- }
- struct myItem *delete(struct myItem *item){
- struct myItem* temp = item->next; //DIE ZU LÖSCHENDE STELLE
- item->next = item->next->next; //Nimmt next von dem nach zu löschenden Element
- free(temp);
- return item;
- }
- //DELETE FROM INDEX
- struct myItem *delete_knoten(struct myItem *item, int knoten){
- int counter;
- counter = 0;
- knoten = knoten -1;
- if(item != NULL){
- while(item != NULL){
- if(counter == knoten){
- struct myItem *temp = item->next;
- item = item->next->next;
- free(temp);
- break;
- }
- counter++;
- }
- return item;
- }
- }
- void append(struct myItem *item, int data){
- struct myItem *new_item = malloc(sizeof(struct myItem));
- new_item->data = data;
- new_item->next = NULL; //LETZE ELEMENT
- //Letzte Stelle finden
- while(item->next != NULL )
- {
- item = item->next;
- }
- item->next = new_item;
- //return new_item;
- //add anfang
- }
- int einlesen(){
- int data;
- printf("Bitte geben Sie eine Zahl ein: ");
- scanf("%i", &data);
- return data;
- }
- int main(){
- struct myItem *liste;
- int userInput;
- liste = NULL;
- userInput = einlesen();
- liste = add_anfang(liste, userInput);
- userInput = einlesen();
- append(liste, userInput);
- userInput = einlesen();
- append(liste, userInput);
- ausgabe(liste);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement