diff options
1 files changed, 0 insertions, 49 deletions
| -rw-r--r-- | Sem. 08/task3.cpp | 49 |
diff --git a/Sem. 08/task3.cpp b/Sem. 08/task3.cpp deleted file mode 100644 index a6b0ca9..0000000 --- a/Sem. 08/task3.cpp +++ /dev/null @@ -1,49 +0,0 @@ -#include <iostream> -using namespace std; - -const int SIZE = 30; -bool isSubarrayPalindrome(int arr[SIZE], int startIndex, int endIndex) -{ - while (startIndex < endIndex) - { - if (arr[startIndex] != arr[endIndex]) - return false; - startIndex++; - endIndex--; - } - return true; -} -void print(int arr[SIZE]) -{ - for (int i = 0; i < SIZE; i++) - cout << arr[i]; - cout << endl; -} - -int longestPalindromicSubarray(int arr[SIZE], int n) -{ - int currentSize = n; - - int startIndex = 0; - int endIndex = startIndex + currentSize-1; - while (true) - { - if (isSubarrayPalindrome(arr, startIndex, endIndex)) - return endIndex - startIndex + 1; - startIndex++; - endIndex++; - if (endIndex == n)//last iteration - { - currentSize--; - startIndex = 0; - endIndex = startIndex + currentSize - 1; - } - } -} -int main() -{ - - int arr[SIZE] = {1,4,3,2,3}; - cout << longestPalindromicSubarray(arr, 5); - -} |
