检查是否可以通过反转任何子字符串来使字符串在字典上变小

给定字符串S ，任务是检查我们是否可以通过反转给定字符串的任何子字符串来使该字符串在字典上更小。

例子：

Input: S = “striver” 
Output: Yes 
Reverse “rive” to get “stevirr” which is lexicographically smaller. 
Input: S = “rxz” 
Output: No  

方法：迭代字符串并检查是否有任何索引s [i]> s [i + 1] 。如果存在至少一个这样的索引，则有可能不存在。
下面是上述方法的实现：

C++

// C++ implementation of the approach
#include 
using namespace std;
 
// Function that returns true if s
// can be made lexicographically smaller
// by reversing a sub-string in s
bool check(string s)
{
    int n = s.size();
 
    // Traverse in the string
    for (int i = 0; i < n - 1; i++) {
 
        // Check if s[i+1] < s[i]
        if (s[i] > s[i + 1])
            return true;
    }
 
    // Not possible
    return false;
}
 
// Driver code
int main()
{
    string s = "geeksforgeeks";
 
    if (check(s))
        cout << "Yes";
    else
        cout << "No";
 
    return 0;
}

Java

// Java implementation of the approach
class GFG
{
 
// Function that returns true if s
// can be made lexicographically smaller
// by reversing a sub-string in s
static boolean check(String s)
{
    int n = s.length();
 
    // Traverse in the string
    for (int i = 0; i < n - 1; i++)
    {
 
        // Check if s[i+1] < s[i]
        if (s.charAt(i) > s.charAt(i + 1))
            return true;
    }
 
    // Not possible
    return false;
}
 
// Driver code
public static void main(String args[])
{
    String s = "geeksforgeeks";
 
    if (check(s))
        System.out.println("Yes");
    else
        System.out.println("No");
 
}
}
 
// This code is contributed by Arnab Kundu

Python3

# Python 3 implementation of the approach
 
# Function that returns true if s
# can be made lexicographically smaller
# by reversing a sub-string in s
def check(s):
    n = len(s)
 
    # Traverse in the string
    for i in range(n-1):
         
        # Check if s[i+1] < s[i]
        if (s[i] > s[i + 1]):
            return True
 
    # Not possible
    return False
 
# Driver code
if __name__ == '__main__':
    s = "geeksforgeeks"
 
    if (check(s)):
        print("Yes")
    else:
        print("No")
 
# This code is contributed by
# Surendra_Gangwar

C#

// C# implementation of the approach
using System;
 
class GFG
{
 
// Function that returns true if s
// can be made lexicographically smaller
// by reversing a sub-string in s
static bool check(String s)
{
    int n = s.Length;
 
    // Traverse in the string
    for (int i = 0; i < n - 1; i++)
    {
 
        // Check if s[i+1] < s[i]
        if (s[i] > s[i + 1])
            return true;
    }
 
    // Not possible
    return false;
}
 
// Driver code
public static void Main(String []args)
{
    String s = "geeksforgeeks";
 
    if (check(s))
        Console.WriteLine("Yes");
    else
        Console.WriteLine("No");
 
}
}
 
// This code has been contributed by 29AjayKumar

PHP

 $s[$i + 1])
            return true;
    }
 
    // Not possible
    return false;
}
 
    // Driver code
    $s = "geeksforgeeks";
 
    if (check($s))
    echo "Yes";
    else
        echo "No";
 
// This code is contributed by jit_t
?>

Javascript

    // Javascript implementation of the approach
     
    // Function that returns true if s
    // can be made lexicographically smaller
    // by reversing a sub-string in s
    function check(s)
    {
        let n = s.length;
 
        // Traverse in the string
        for (let i = 0; i < n - 1; i++)
        {
 
            // Check if s[i+1] < s[i]
            if (s[i] > s[i + 1])
                return true;
        }
 
        // Not possible
        return false;
    }
     
    let s = "geeksforgeeks";
   
    if (check(s))
        document.write("Yes");
    else
        document.write("No");
 

输出：

Yes

如果您希望与行业专家一起参加现场课程，请参阅《 Geeks现场课程》和《 Geeks现场课程美国》。