Question

Using for-loops, develop an algorithm that RETURNS A STRING formatted as a staircase using the character ‘x’ (lower case). The staircase should have the following properties:
N steps going up from left to right
The top step should have one ‘x’, the second step from the top have two ‘x’s, the third step from the top should have three ‘x’s, … , the bottom step should have N ‘x’s.
Generally, the nth step from the top should have n ‘x’s

Example output for N = 10:
_________x↩
________xx↩
_______xxx↩
______xxxx↩
_____xxxxx↩
____xxxxxx↩
___xxxxxxx↩
__xxxxxxxx↩
_xxxxxxxxx↩
xxxxxxxxxx↩

Note: the underscores (“_”) should be spaces (“ “) and the arrows (“↩”) should be replaced with carriage returns. I’ve included them here to draw attention to the fact that there should be spaces preceding the step. Your output has to exactly match the specifications to be considered correct. The method should look like this:

public String printPattern(int n) {

}

Answer 1

Code:

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Test
{
   public static String printPattern(int n){
       String result="";
       int temp=n-1;
       while(temp>0){
           for(int i=0;i<temp;i++){
          
           result=result+" ";
           }
          
           for(int i=temp;i<n;i++){
           result=result+"Z";
           }
       result=result+" ";
       temp--;
       }
       return result;
   }
  
public static void main(String[] args)
{
       String result=printPattern(10);
       System.out.println(result);
   }
}

output:

Hit thumps up, if you like the solution.

thanks