Are you searching for solution for finding longest palindrome in string? If so we’ve something for you. We have following C# example for finding longest palindrome in character array (or string). We’ve two different while loop to find longest palindrome for odd length palindromes and even lenth palindromes.
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 | /// <summary> /// This method finds longest palindrome in a character array. /// </summary> /// <param name="input">array of characters</param> public void FindLongestPalindrome(char[] input) { int len; int i = 0, j = 0, k = 0, l = 0; int lower = 0, upper = 0; len = input.Length; /*Odd length Palindromes*/ while (i < len && j < len) { k = i; l = j; while ((k >= 0 && l < len) && (input[k] == input[l])) { if ((upper - lower) <= (l - k)) { lower = k; upper = l; } k--; l++; } i++; j++; } /*Even length Palindromes*/ i = 0; j = 1; while (i < len && j < len) { k = i; l = j; while ((k >= 0 && l < len) && (input[k] == input[l])) { if ((upper - lower) <= (l - k)) { lower = k; upper = l; } k--; l++; } i++; j++; } for (i = lower; i <= upper; i++) { Console.Write(input[i]); } Console.WriteLine(); } |

Leave a Reply
You must be logged in to post a comment.