Lexicographically next string

Given a string, find lexicographically next string.

Examples:

Input : geeks
Output : geekt
The last character 's' is changed to 't'.

Input : raavz
Output : raawz
Since we can't increase last character, 
we increment previous character.

Input :  zzz
Output : zzza

If string is empty, we return ‘a’. If string contains all characters as ‘z’, we append ‘a’ at the end. Otherwise we find first character from end which is not z and increment it.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to find lexicographically next
// string
#include <bits/stdc++.h>
using namespace std;
  
string nextWord(string s)
{
    // If string is empty.
    if (s == "")
        return "a";
  
    // Find first character from right 
    // which is not z.
      
    int i = s.length() - 1;
    while (s[i] == 'z' && i >= 0)
        i--;
  
    // If all characters are 'z', append
    // an 'a' at the end.
    if (i == -1) 
        s = s + 'a';
  
    // If there are some non-z characters 
    else
        s[i]++;
  
    return s; 
}
  
// Driver code
int main()
{
    string str = "samez";
    cout << nextWord(str);
    return 0;
}

chevron_right






                        filter_none









Java














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Java program to find  


// lexicographically next string 


import java.util.*; 


  


class GFG 


{ 


public static String nextWord(String str) 


{ 


      


    // if string is empty 


    if (str == "") 


    return "a"; 


      


    // Find first character from 


    // right which is not z. 


    int i = str.length() - 1; 


    while (str.charAt(i) == 'z' && i >= 0) 


        i--; 


          


    // If all characters are 'z',  


    // append an 'a' at the end. 


    if (i == -1)  


        str = str + 'a'; 


  


// If there are some 


// non-z characters  


else


    str = str.substring(0, i) +  


         (char)((int)(str.charAt(i)) + 1) +  


                      str.substring(i + 1); 


return str;  


} 


  


// Driver Code 


public static void main (String[] args) 


{ 


    String str = "samez"; 


    System.out.print(nextWord(str)); 


} 


} 


  


// This code is contributed  


// by Kirti_Mangal 



















                        chevron_right







                        filter_none









Python3





# Python 3 program to find lexicographically

# next string


def nextWord(s):


	# If string is empty.

	if (s == ” “):

		return “a”


	# Find first character from right

	# which is not z.

	i = len(s) – 1

	while (s[i] == ‘z’ and i >= 0):

		i -= 1


	# If all characters are ‘z’, append

	# an ‘a’ at the end.

	if (i == -1):

		s = s + ‘a’


	# If there are some non-z characters

	else:

		s = s.replace(s[i], chr(ord(s[i]) + 1), 1) 


	return s


# Driver code

if __name__ == ‘__main__’:

	str = “samez”

	print(nextWord(str))


# This code is contributed by

# Sanjit_Prasad



C#














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// C# program to find  


// lexicographically next string  


using System; 


  


class GFG 


{ 


public static string nextWord(string str) 


{ 


  


    // if string is empty  


    if (str == "") 


    { 


    return "a"; 


    } 


  


    // Find first character from  


    // right which is not z.  


    int i = str.Length - 1; 


    while (str[i] == 'z' && i >= 0) 


    { 


        i--; 


    } 


  


    // If all characters are 'z',  


    // append an 'a' at the end.  


    if (i == -1) 


    { 


        str = str + 'a'; 


    } 


  


    // If there are some  


    // non-z characters  


    else


    { 


        str = str.Substring(0, i) + 


             (char)((int)(str[i]) + 1) +  


              str.Substring(i + 1); 


    } 


    return str; 


} 


  


// Driver Code  


public static void Main(string[] args) 


{ 


    string str = "samez"; 


    Console.Write(nextWord(str)); 


} 


} 


  


// This code is contributed by Shrikant13 



















                        chevron_right







                        filter_none










Output:


samfz



This article is contributed by Pawan Asipu. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.


Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



          
          
          
          

            

    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:


      
      
      
      

      

      
					
		

    Article Tags : 
Strings

           	
Practice Tags : 
Strings

        

         

         
 
         
        Be the First to upvote.

                

        



        
        
        
        
        

    

            

            2.2
            

            

             
                 Based on 4 vote(s)
                    

            
            
            
            
            
        

        
        

        

        

        

        

        

        


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.