Problem with a one-dimensional array. C language

Question

Please help solve the problem. An array of integers is given. Determine how many times the sign changes in the longest sequence of numbers that does not contain zeros. C language. Thank you very much.

int main() { const int N = 10; int mas[N], i; setlocale(LC_ALL, "Rus"); for (i = 0; i < N; i++) { printf_s("\tmas[%d] = ", i); scanf_s("%d", &mas[i]); } printf_s("\t"); for (i = 0; i < N; i++) printf_s("%d ", mas[i]); printf_s("\n"); int count = 0; for (i = 0; i < N - 1; i++) if (mas[i] > 0 && mas[i + 1] < 0 || mas[i] < 0 && mas[i + 1] > 0) count++; printf_s("\t%d", count); _getch(); return 0; }

# include <stdio.h> # include <conio.h> # include <locale.h> int main () {const int N = 10;
for (i = 0; i <N - 1; i ++) if (mas [i]> 0 && mas [i + 1] <0 || mas [i] <0 && mas [i + 1]> 0) count ++ ;
You can click on it, and in the opened editor insert your code, select it and press Ctrl-K on the keyboard or {} on the toolbar.

Accepted Answer · 2018-10-18T21:18:43

 ... int maxCount = 0; int maxLength = 0; int count = 0; int length = 0; for (i = 0; i < N - 1; i++) { if (mas[i] == 0) { if (length > maxLength) { maxLength = length; maxCount = count; } length = 0; count = 0; } else { length++; } if ((mas[i] > 0 && mas[i + 1] < 0) || (mas[i] < 0 && mas[i + 1] > 0)) count++; } if (length > maxLength) { maxLength = length; maxCount = count; } // print maxLength and maxCount

https://onlinegdb.com/rk0ofYIjQ

Because my answer for any combination of numbers turns out to be zero.
I think you inaccurately copied the code to yourself: onlinegdb.com/rk0ofYIjQ

Problem with a one-dimensional array. C language

1 answer 1

More articles: