Как составить палиндром предложение

#include <bits/stdc++.h>

using namespace std;

bool sentencePalindrome(string str)

{

    int l = 0, h = str.length() - 1;

    for (int i = 0; i <= h; i++)

        str[i] = tolower(str[i]);

    while (l <= h) {

        if (!(str[l] >= 'a' && str[l] <= 'z'))

            l++;

        else if (!(str[h] >= 'a' && str[h] <= 'z'))

            h--;

        else if (str[l] == str[h])

            l++, h--;

        else

            return false;

    }

    return true;

}

int main()

{

    string str = "Too hot to hoot.";

    if (sentencePalindrome(str))

        cout << "Sentence is palindrome.";

    else

        cout << "Sentence is not palindrome.";

    return 0;

}

public class GFG

{

    static boolean sentencePalindrome(String str)

    {   

        int l = 0;

        int h = str.length()-1;

        str = str.toLowerCase();

        while(l <= h)

        {

            char getAtl = str.charAt(l);

            char getAth = str.charAt(h);

            if (!(getAtl >= 'a' && getAtl <= 'z'))

                l++;

            else if(!(getAth >= 'a' && getAth <= 'z'))

                h--;

            else if( getAtl == getAth)

            {

                l++;

                h--;

            }

            else

                return false;

        }

        return true;   

    }

    public static void main(String[] args)

    {

        String str = "Too hot to hoot.";

        if( sentencePalindrome(str))

          System.out.println("Sentence is palindrome");

        else

          System.out.println("Sentence is not" + " " +

                                         "palindrome");

    }

}

def sentencePalindrome(s):

    l, h = 0, len(s) - 1

    s = s.lower()

    while (l <= h):

        if (not(s[l] >= 'a' and s[l] <= 'z')):

            l += 1

        elif (not(s[h] >= 'a' and s[h] <= 'z')):

            h -= 1

        elif (s[l] == s[h]):

            l += 1

            h -= 1

        else:

            return False

    return True

s = "Too hot to hoot."

if (sentencePalindrome(s)):

    print ("Sentence is palindrome.")

else:

    print ("Sentence is not palindrome.")

using System;

public class GFG

{

    static bool sentencePalindrome(String str)

    {

        int l = 0;

        int h = str.Length - 1;

        str = str.ToLower();

        while(l <= h)

        {

            char getAtl = str[l];

            char getAth = str[h];

            if (!(getAtl >= 'a' &&

                  getAtl <= 'z'))

                l++;

            else if(! (getAth >= 'a' &&

                       getAth <= 'z'))

                h--;

            else if( getAtl == getAth)

            {

                l++;

                h--;

            }

            else

                return false;

        }

        return true;

    }

    public static void Main()

    {

        String str = "Too hot to hoot.";

        if( sentencePalindrome(str))

        Console.Write("Sentence is palindrome");

        else

        Console.Write("Sentence is not" + " " +

                                     "palindrome");

    }

}

<?php

function sentencePalindrome($str)

{

    $l = 0;

    $h = strlen($str)-1;

    for ($i = 0; $i < $h; $i++)

        $str[$i] = strtolower($str[$i]);

    while ($l <= $h) {

        if (!($str[$l] >= 'a' && $str[$l] <= 'z'))

            $l++;

        else if (!($str[$h] >= 'a' && $str[$h] <= 'z'))

            $h--;

        else if ($str[$l] == $str[$h])

        {

             $l++;

            $h--;

        }

        else

            return false;

    }

    return true;

}

$str = "Too hot to hoot.";

if (sentencePalindrome($str))

    echo "Sentence is palindrome.";

else

    echo "Sentence is not palindrome.";

return 0;

?>

<script>

    function sentencePalindrome(str)

    {

        let l = 0;

        let h = str.length-1;

        str = str.toLowerCase();

        while(l <= h)

        {

            let getAtl = str[l];

            let getAth = str[h];

            if (!(getAtl >= 'a' && getAtl <= 'z'))

                l++;

            else if(!(getAth >= 'a' && getAth <= 'z'))

                h--;

            else if( getAtl == getAth)

            {

                l++;

                h--;

            }

            else

                return false;

        }

        return true;  

    }

    let str = "Too hot to hoot.";

    if( sentencePalindrome(str))

        document.write("Sentence is palindrome");

    else

        document.write("Sentence is not" + " " +

                                         "palindrome");

</script>

#include <bits/stdc++.h>

using namespace std;

bool isPalindrome(string str)

{

    transform(str.begin(), str.end(), str.begin(), ::tolower);

    str.erase(remove(str.begin(), str.end(), ' '), str.end());

    string s1 = str;

    string s2 = str;

    reverse(s1.begin(), s1.end());

    return s1 == s2;

}

int main()

{

    string str = "Too hot to hoot";

    if (isPalindrome(str))

        cout << "Sentence is palindrome.";

    else

        cout << "Sentence is not palindrome.";

    return 0;

}

import java.io.*;

public class GFG

{

    static boolean sentencePalindrome(String s)

    {

        if(s.isEmpty())        

        return true;

    String str = s.toLowerCase();

    str = str.replaceAll("[^a-zA-Z0-9]", "");

    StringBuilder revstr = new StringBuilder(str);

    revstr.reverse();

    String rstr = revstr.toString();

    if(str.equals(rstr))

        return true;

    return false;              

}

    public static void main(String[] args)

    {

        String str = "Too hot to hoot.";

        if( sentencePalindrome(str))

        System.out.println("Sentence is palindrome");

        else

        System.out.println("Sentence is not" + " " +

                                        "palindrome");

    }

}

def isPalindrome(s):

    s1 = s.replace(' ', '')

    s1 = s1.lower()

    s2 = s1[::-1];

    return True if s1 == s2 else False

s = "Too hot to hoot"

if (isPalindrome(s)):

    print ("Sentence is palindrome.")

else:

    print ("Sentence is not palindrome.")

using System;

using System.Collections.Generic;

using System.Collections;

using System.Linq;

class HelloWorld {

    public static bool isPalindrome(string str)

    {

        str = str.Replace(" ", string.Empty);

        str = str.ToLower();

        string s1 = str;

        string s2 = str;

        char[] charArray = str.ToCharArray();

        Array.Reverse(charArray);

        s1 = new string(charArray);

        return s1 == s2;

    }

    static void Main() {

        string str = "Too hot to hoot";

        if (isPalindrome(str))

            Console.WriteLine("Sentence is palindrome.");

        else

            Console.WriteLine("Sentence is not palindrome.");

    }

}

    function isPalindrome(str)

    {

        let s1 = str.split(' ').join('');

        s1 = s1.toLowerCase();

        let s2 = s1.split('').reverse().join('');

        return true ? s1 == s2 : false;

    }

    let str = "Too hot to hoot";

    if( isPalindrome(str))

        console.log("Sentence is palindrome");

    else

        console.log("Sentence is not palindrome");

#include <iostream>

#include <algorithm>

#include <stack>

using namespace std;

bool sentencePalindrome(string s)

{

    string str = "";

    for (char c : s){

        if (isalnum(c))

            str += tolower(c);

    }

    string reverse_str = str;

    reverse(reverse_str.begin(), reverse_str.end());

    return str == reverse_str;

}

int main()

{

    string str = "Too hot to hoot.";

    if (sentencePalindrome(str))

        cout << "Sentence is palindromen";

    else

        cout << "Sentence is not palindromen";

    return 0;

}

import java.io.*;

import java.util.*;

class GFG {

    static boolean sentencePalindrome(String s)

    {  

    char[] str = s.toCharArray();

    Stack<Character> stack = new Stack<>();

    for (int i = 0; i < s.length(); i++){

        if (Character.isLetterOrDigit(str[i]))

            stack.push(str[i]);

    }

    String string = "";

    String reverse = "";

    for (Character character : stack) {

        reverse += Character.toLowerCase(character);

    }

    while (!stack.isEmpty()){

        string += Character.toLowerCase(stack.pop());

    }

    return string.equals(reverse); 

    }

public static void main(String[] args)

    {

        String str = "Too hot to hoot.";

        if( sentencePalindrome(str))

          System.out.println("Sentence is palindrome");

        else

          System.out.println("Sentence is not" + " " +

                                         "palindrome");

    }

}

def sentence_palindrome(s):

    str_ = ""

    for c in s:

        if c.isalnum():

            str_ += c.lower()

    reverse_str = str_[::-1]

    return str_ == reverse_str

if __name__ == "__main__":

    str_ = "Too hot to hoot."

    if sentence_palindrome(str_):

        print("Sentence is palindrome")

    else:

        print("Sentence is not palindrome")

using System;

using System.Collections.Generic;

class GFG {

    static bool sentencePalindrome(string s)

    {  

        char[] str = s.ToCharArray();

        Stack<char> stack = new Stack<char>();

        for (int i = 0; i < s.Length; i++){

            if (Char.IsLetterOrDigit(str[i]))

                stack.Push(str[i]);

        }

        string originalString = "";

        string reverseString = "";

        foreach (char character in stack) {

            reverseString += Char.ToLower(character);

        }

        while (stack.Count > 0){

            originalString += Char.ToLower(stack.Pop());

        }

        return originalString.Equals(reverseString); 

    }

    public static void Main(string[] args)

    {

        string str = "Too hot to hoot.";

        if(sentencePalindrome(str))

          Console.WriteLine("Sentence is palindrome");

          else

          Console.WriteLine("Sentence is not" + " " +

                                         "palindrome");

    }

}

function sentencePalindrome(s) {

  let str = "";

  for (let i = 0; i < s.length; i++) {

    const c = s.charAt(i);

    if (c.match(/[a-zA-Z0-9]/))

      str += c.toLowerCase();

  }

  const reverse_str = str.split("").reverse().join("");

  return str === reverse_str;

}

const str = "Too hot to hoot.";

if (sentencePalindrome(str))

  console.log("Sentence is palindrome");

else

  console.log("Sentence is not palindrome");