FilesExpand file tree

 master

/

Singly-Linked-List(Pointer).cpp

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

97 lines (89 loc) · 1.15 KB

 master

/

Singly-Linked-List(Pointer).cpp

Top

File metadata and controls

• Code
• Blame

97 lines (89 loc) · 1.15 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

#include <cstdio>

#define NIL 0

using namespace std;

struct node

{

int id, value;

node *next;

};

node *head;

void insert(int id, int value)

{

node *o = new node;

o->next = head;

head = o;

o->id = id;

o->value = value;

}

int find(int id)

{

node *cur = head;

while (cur != NIL)

{

if (cur->id == id)

{

return cur->value;

}

cur = cur->next;

}

return -1;

}

bool del(int id)

{

if (head == NIL)

{

return false;

}

if (head->id == id)

{

node *temp = head;

head = head->next;

delete temp;

return true;

}

node *prev = head, *cur = head->next;

while (cur != NIL)

{

if (cur->id == id)

{

prev->next = cur->next;

delete cur;

return true;

}

prev = cur;

cur = cur->next;

}

return false;

}

int main()

{

int in, id, value;

while (true)

{

scanf("%d", &in);

if (in == 1)

{

scanf("%d%d", &id, &value);

insert(id, value);

}

else if (in == 2)

{

scanf("%d", &id);

printf("%d\n", find(id));

}

else if (in == 3)

{

scanf("%d", &id);

printf("%s\n", del(id) == true ? "deleted" : "failed");

}

else if (in == 0)

{

return 0;

}

else

{

printf("No such command!\n");

}

}

return 0;

}