Skip to main content

Write a function that reverses the order of the words in a string.

Write a function that reverses the order of the words in a string.
For Example, your function should transform the string
"Do or do not, there is no try." to "try. no is there not, do or Do".
Assume that all words are space delimited and treat punctuation same as letters.

Filename: Execute.java
----------------------------------------------------------------------------------------------------

package org.developersbrain.solutions;

public class Execute {

public static String reverseWords(String str,char delimiter){
//Split the words into array of strings
char[] chrArray=str.toCharArray();
int no_of_Delimiters=0;
for(int i=0;i<chrArray.length;i++){
if(chrArray[i]==delimiter) no_of_Delimiters++;
}

//Populate string list of words
String[] strList=new String[no_of_Delimiters+1];

for(int i=0,j=0;j<chrArray.length;j++){
if(i==0 && j==0){
strList[i]="";
}

if(chrArray[j]==delimiter){
i++;
strList[i]="";
}else{
strList[i]=strList[i]+chrArray[j];
}
}

//Reverse the array strList
String retStr="";
for(int i=strList.length-1;i>=0;i--){
retStr = retStr+strList[i]+delimiter;
}

return retStr;

}

public static void main(String[] args){
String inputString="Do or do not, there is no try.";
System.out.println("Input String:");
System.out.println("----------------------------------");
System.out.println(inputString);
System.out.println();
System.out.println("Output:");
System.out.println("----------------------------------");
System.out.println(reverseWords("Do or do not, there is no try.",' '));
}
}


Program Output:
++++++++++++++++++++++++++++++++++++++++++++++


Input String:
----------------------------------
Do or do not, there is no try.

Output:
----------------------------------
try. no is there not, do or Do 


Comments

Popular posts from this blog

Java Interface

Problem Statement A Java interface can only contain method signatures and fields. Interface can be used to achieve polymorphism. In this problem you will practice your knowledge on interfaces. You are given an interface   AdvancedArithmetic   which contains a method signature   public abstract int divisorSum(int n) . You need to write a class called MyCalculator which implements the interface. divisorSum   function just takes an integer as input and return the sum of all its divisors. For example divisors of 6 are 1,2,3 and 6, so   divisorSum   should return 12. Value of n will be at most 1000. Read the partially completed code in the editor and complete it. You just need to write the MyCalculator class only.   Your class shouldn't be public. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation Divisors of 6 are 1,2,3 and 6. 1+2+3+6=12. import java.util.*; interface AdvancedArithmetic{   public abstract int divisorSum(int n

Problem: Java Exception Handling

Problem Statement Create a class myCalculator which consists of a single method power(int,int). This method takes two integers,   n   and   p , as parameters and finds   n p . If either   n   or   p   is negative, then the method must throw an exception which says "n and p should be non-negative". Please read the partially completed code in the editor and complete it. Your code mustn't be public. No need to worry about constraints, there won't be any overflow if your code is correct. Sample Input 3 5 2 4 -1 -2 -1 3 Sample Output 243 16 java.lang.Exception: n and p should be non-negative java.lang.Exception: n and p should be non-negative import  java.util.*; class myCalculator{     int power(int n,int p) throws java.lang.Exception{         int power=1;         while(p>0){             power=power*(n);             p--;         }                 if(n==0) power=0;                if(n<0 | p<0){       

Google Cloud Shell | Delete instance