Java program import java.util.Scanner; import java.util.Stack; public class Main { public static void main(String l args) System.out.print ("Enter any string : "); Scanner in = new Scanner(System.in); String origstring = in.nextLine(); Stack stack = new Stack<>(); //Push all chars in stack for (int i = 0; i < origString. length(); i++) { stack.push(origString.charAt(i)); } String reversestring = ""; //Pop all chars from stack one by one and build reverse string while (!stack.isEmpty()) { reversestring = reversestring + stack.pop(); } //Check palindrome string if (origstring.equals(reversestring)) { System.out.println ("String is a palindrome."); } else { System.out.print ln("String is not a palindrome."); }

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Add comments to this code 

Java program
import java.util.Scanner;
import java.util.Stack;
public class Main
{
public static void main(String [0 args)
System.out.print ("Enter any string : ");
Scanner in = new Scanner(System. in);
String origstring = in.nextLine();
Stack<Character> stack = new Stack<>();
//Push all chars in stack
for (int i = 0; i< origString. length(); i++) {
stack.push(origstring.charAt (i));
String reversestring = "";
//Pop all chars from stack one by one and build reverse string
while (!stack.isEmpty()) {
reversestring = reverseString + stack.pop();
//Check palindrome string
if (origstring.equals (reverseString)) {
System.out.println("String is a palindrome.");
} else {
System.out.println("String is not a palindrome.");
Transcribed Image Text:Java program import java.util.Scanner; import java.util.Stack; public class Main { public static void main(String [0 args) System.out.print ("Enter any string : "); Scanner in = new Scanner(System. in); String origstring = in.nextLine(); Stack<Character> stack = new Stack<>(); //Push all chars in stack for (int i = 0; i< origString. length(); i++) { stack.push(origstring.charAt (i)); String reversestring = ""; //Pop all chars from stack one by one and build reverse string while (!stack.isEmpty()) { reversestring = reverseString + stack.pop(); //Check palindrome string if (origstring.equals (reverseString)) { System.out.println("String is a palindrome."); } else { System.out.println("String is not a palindrome.");
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY