Mindste palindrom efter udskiftning
Givet en streng, som har nogle små bogstaver i alfabetet og en speciel karakter prik(.). Vi er nødt til at erstatte alle prikker med et eller andet alfabet på en sådan måde, at den resulterende streng bliver et palindrom i tilfælde af mange mulige erstatninger, vi skal vælge palindromstreng, som er leksikografisk mindst. Hvis det ikke er muligt at konvertere streng til palindrom efter alle mulige udskiftninger, så output Ikke muligt.
Eksempler:
Input : str = ab..e.c.a Output : abcaeacba The smallest palindrome which can be made after replacement is 'abcaeacba' We replaced first dot with 'c' second dot with 'a' third dot with 'a' and fourth dot with 'b' Input : str = ab..e.c.b Output : Not Possible It is not possible to convert above string into palindrome
Vi kan løse dette problem på følgende måde Da den resulterende streng skal være palindrom, kan vi kontrollere et par af ikke-prik-tegn ved at starte sig selv, hvis de ikke matcher, så direkte returnering er ikke mulig, fordi vi kun kan placere et nyt tegn i positionen af prikker, ikke andre steder.
Derefter itererer vi over tegn i streng, hvis det nuværende tegn er prik, så tjekker vi dets parrede tegn (tegn ved (n – i -1) position), hvis det tegn også er prik, så kan vi erstatte begge tegn med 'a', fordi 'a' er det mindste alfabet med små bogstaver, hvilket vil garantere den mindste leksikografiske streng i slutningen, hvis begge tegn erstattes af en hvilken som helst anden tegn, vil det resultere i en stor palindikografisk streng. I andre tilfælde, hvis det parrede tegn ikke er en prik, skal vi erstatte det nuværende tegn med dets parrede tegn for at lave et strengpalindrom.
So in short If both 'i' and 'n- i- 1' are dot replace them by ‘a’ If one of them is a dot character replace that by other non-dot character
Ovenstående procedure giver os leksikografisk mindste palindromstreng.
Implementering:
C++ // C++ program to get lexicographically smallest // palindrome string #include using namespace std ; // Utility method to check str is possible palindrome // after ignoring . bool isPossiblePalindrome ( string str ) { int n = str . length (); for ( int i = 0 ; i < n / 2 ; i ++ ) { /* If both left and right character are not dot and they are not equal also then it is not possible to make this string a palindrome */ if ( str [ i ] != '.' && str [ n - i -1 ] != '.' && str [ i ] != str [ n - i -1 ]) return false ; } return true ; } // Returns lexicographically smallest palindrom // string if possible string smallestPalindrome ( string str ) { if ( ! isPossiblePalindrome ( str )) return 'Not Possible' ; int n = str . length (); // loop through character of string for ( int i = 0 ; i < n ; i ++ ) { if ( str [ i ] == '.' ) { // if one of character is dot replace dot // with other character if ( str [ n - i - 1 ] != '.' ) str [ i ] = str [ n - i - 1 ]; // if both character are dot then replace // them with smallest character 'a' else str [ i ] = str [ n - i - 1 ] = 'a' ; } } // return the result return str ; } // Driver code to test above methods int main () { string str = 'ab..e.c.a' ; cout < < smallestPalindrome ( str ) < < endl ; return 0 ; }
Java // Java program to get lexicographically // smallest palindrome string class GFG { // Utility method to check str is // possible palindrome after ignoring static boolean isPossiblePalindrome ( char str [] ) { int n = str . length ; for ( int i = 0 ; i < n / 2 ; i ++ ) { /* If both left and right character are not dot and they are not equal also then it is not possible to make this string a palindrome */ if ( str [ i ] != '.' && str [ n - i - 1 ] != '.' && str [ i ] != str [ n - i - 1 ] ) return false ; } return true ; } // Returns lexicographically smallest // palindrome string if possible static void smallestPalindrome ( char str [] ) { if ( ! isPossiblePalindrome ( str )) System . out . println ( 'Not Possible' ); int n = str . length ; // loop through character of string for ( int i = 0 ; i < n ; i ++ ) { if ( str [ i ] == '.' ) { // if one of character is dot // replace dot with other character if ( str [ n - i - 1 ] != '.' ) str [ i ] = str [ n - i - 1 ] ; // if both character are dot // then replace them with // smallest character 'a' else str [ i ] = str [ n - i - 1 ] = 'a' ; } } // return the result for ( int i = 0 ; i < n ; i ++ ) System . out . print ( str [ i ] + '' ); } // Driver code public static void main ( String [] args ) { String str = 'ab..e.c.a' ; char [] s = str . toCharArray (); smallestPalindrome ( s ); } } // This code is contributed // by ChitraNayal
Python 3 # Python 3 program to get lexicographically # smallest palindrome string # Utility method to check str is # possible palindrome after ignoring def isPossiblePalindrome ( str ): n = len ( str ) for i in range ( n // 2 ): # If both left and right character # are not dot and they are not # equal also then it is not possible # to make this string a palindrome if ( str [ i ] != '.' and str [ n - i - 1 ] != '.' and str [ i ] != str [ n - i - 1 ]): return False return True # Returns lexicographically smallest # palindrome string if possible def smallestPalindrome ( str ): if ( not isPossiblePalindrome ( str )): return 'Not Possible' n = len ( str ) str = list ( str ) # loop through character of string for i in range ( n ): if ( str [ i ] == '.' ): # if one of character is dot # replace dot with other character if ( str [ n - i - 1 ] != '.' ): str [ i ] = str [ n - i - 1 ] # if both character are dot # then replace them with # smallest character 'a' else : str [ i ] = str [ n - i - 1 ] = 'a' # return the result return str # Driver code if __name__ == '__main__' : str = 'ab..e.c.a' print ( '' . join ( smallestPalindrome ( str ))) # This code is contributed by ChitraNayal
C# // C# program to get lexicographically // smallest palindrome string using System ; public class GFG { // Utility method to check str is // possible palindrome after ignoring static bool isPossiblePalindrome ( char [] str ) { int n = str . Length ; for ( int i = 0 ; i < n / 2 ; i ++ ) { /* If both left and right character are not dot and they are not equal also then it is not possible to make this string a palindrome */ if ( str [ i ] != '.' && str [ n - i - 1 ] != '.' && str [ i ] != str [ n - i - 1 ]) return false ; } return true ; } // Returns lexicographically smallest // palindrome string if possible static void smallestPalindrome ( char [] str ) { if ( ! isPossiblePalindrome ( str )) Console . WriteLine ( 'Not Possible' ); int n = str . Length ; // loop through character of string for ( int i = 0 ; i < n ; i ++ ) { if ( str [ i ] == '.' ) { // if one of character is dot // replace dot with other character if ( str [ n - i - 1 ] != '.' ) str [ i ] = str [ n - i - 1 ]; // if both character are dot // then replace them with // smallest character 'a' else str [ i ] = str [ n - i - 1 ] = 'a' ; } } // return the result for ( int i = 0 ; i < n ; i ++ ) Console . Write ( str [ i ] + '' ); } // Driver code public static void Main () { String str = 'ab..e.c.a' ; char [] s = str . ToCharArray (); smallestPalindrome ( s ); } } // This code is contributed by PrinciRaj1992
PHP // PHP program to get lexicographically // smallest palindrome string // Utility method to check str is // possible palindrome after ignoring function isPossiblePalindrome ( $str ) { $n = strlen ( $str ); for ( $i = 0 ; $i < $n / 2 ; $i ++ ) { /* If both left and right character are not dot and they are not equal also then it is not possible to make this string a palindrome */ if ( $str [ $i ] != '.' && $str [ $n - $i - 1 ] != '.' && $str [ $i ] != $str [ $n - $i - 1 ]) return false ; } return true ; } // Returns lexicographically smallest // palindrome string if possible function smallestPalindrome ( $str ) { if ( ! isPossiblePalindrome ( $str )) return 'Not Possible' ; $n = strlen ( $str ); // loop through character of string for ( $i = 0 ; $i < $n ; $i ++ ) { if ( $str [ $i ] == '.' ) { // if one of character is dot // replace dot with other character if ( $str [ $n - $i - 1 ] != '.' ) $str [ $i ] = $str [ $n - $i - 1 ]; // if both character are dot // then replace them with // smallest character 'a' else $str [ $i ] = $str [ $n - $i - 1 ] = 'a' ; } } // return the result return $str ; } // Driver code $str = 'ab..e.c.a' ; echo smallestPalindrome ( $str ); // This code is contributed // by ChitraNayal ?>
JavaScript < script > // Javascript program to get lexicographically // smallest palindrome string // Utility method to check str is // possible palindrome after ignoring function isPossiblePalindrome ( str ) { let n = str . length ; for ( let i = 0 ; i < Math . floor ( n / 2 ); i ++ ) { /* If both left and right character are not dot and they are not equal also then it is not possible to make this string a palindrome */ if ( str [ i ] != '.' && str [ n - i - 1 ] != '.' && str [ i ] != str [ n - i - 1 ]) return false ; } return true ; } // Returns lexicographically smallest // palindrome string if possible function smallestPalindrome ( str ) { if ( ! isPossiblePalindrome ( str )) document . write ( 'Not Possible' ); let n = str . length ; // loop through character of string for ( let i = 0 ; i < n ; i ++ ) { if ( str [ i ] == '.' ) { // if one of character is dot // replace dot with other character if ( str [ n - i - 1 ] != '.' ) str [ i ] = str [ n - i - 1 ]; // if both character are dot // then replace them with // smallest character 'a' else str [ i ] = str [ n - i - 1 ] = 'a' ; } } // return the result for ( let i = 0 ; i < n ; i ++ ) document . write ( str [ i ] + '' ); } // Driver code let str = 'ab..e.c.a' ; let s = str . split ( '' ); smallestPalindrome ( s ); // This code is contributed by rag2127 < /script>
Produktion
abcaeacba
Tidskompleksitet: O(n) hvor n er længden af strengen.
Auxiliary Space kompleksitet: O(1)
