some study

I decided to study in hackerrank these days. just for practice and think more. for this question

https://www.hackerrank.com/challenges/staircase

java 7 solution

import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); for (int i = 1; i <n+1 ; i++) { String s = new String(new char[n-i]).replace('\0', ' '); s += new String(new char[n-s.length()]).replace('\0', '#'); System.out.println(s); } } }
 at least there is not two for loop :)