Insaf_Ilyazov/Primite_plz_i
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: Insaf_Ilyazov:34345e455b3fef74c96e793c8b4443d58948bc9e
Branches Tags
Insaf_Ilyazov:main
..
compare: Insaf_Ilyazov:73512dbe738d799e37843b959131cdeaadbe610c
Branches Tags
Insaf_Ilyazov:main

No commits in common. "34345e455b3fef74c96e793c8b4443d58948bc9e" and "73512dbe738d799e37843b959131cdeaadbe610c" have entirely different histories.
34345e455b ... 73512dbe73

1 changed files with 0 additions and 147 deletions
Show Stats Expand all files Collapse all files

147
iii.txt
View File

@ -1,147 +0,0 @@
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
struct Node* first = NULL;
void addToHead(int value) {
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->next = first;
newNode->data = value;
first = newNode;
}
void printList() {
struct Node* ptr = first;
while (ptr != NULL) {
printf("(%d) -> ", ptr->data);
ptr = ptr->next;
}
printf("NULL\n");
}
int deleteFromHead() {
int value = first->data;
struct Node* delNode = first;
first = first->next;
free(delNode);
return value;
}
int contains(int value) {
struct Node* ptr = first;
while (ptr != NULL) {
if (ptr->data == value) {
return 1;
}
ptr = ptr->next;
}
return 0;
}
void clearList() {
while (first != NULL)
{
struct Node* delNode = first;
first = first->next;
free(delNode);
}
}
int sum()
{
struct Node* ptr = first;
int s = 0;
while (ptr != NULL) {
s += ptr->data;
ptr = ptr->next;
}
return s;
}
int evenCount()
{
struct Node* ptr = first;
int count = 0;
while (ptr != NULL) {
if (ptr->data % 2 == 0) {
count++;
}
ptr = ptr->next;
}
return count;
}
int oddX10()
{
struct Node* ptr = first;
while (ptr != NULL) {
if (ptr->data % 2 != 0) {
ptr->data *= 10;
}
ptr = ptr->next;
}
}
void element100(int i) {
struct Node* ptr = first;
int index = 0;
while (ptr != NULL) {
if (index == i) {
ptr->data = ptr->data * 100;
return;
}
ptr = ptr->next;
index++;
}
}
void leftelement(int i) {
struct Node* ptr = first;
int index = 0;
while (ptr != NULL && index < i) {
ptr->data *= 10;
ptr = ptr->next;
index++;
}
}
void main() {
printList();
addToHead(1);
addToHead(3);
addToHead(6);
addToHead(9);
printList();
printf("sum = %d\n", sum());
printf("even numbers = %d\n", evenCount());
oddX10();
printList();
element100(0);
printList();
element100(3);
printList();
leftelement(2);
printList();
}
dsfsdfsdf