【HackerRank】 Sherlock and The Beast

Sherlock and The Beast

Sherlock Holmes is getting paranoid about Professor Moriarty, his archenemy. All his efforts to subdue Moriarty have been in vain. These days Sherlock is working on a problem with Dr. Watson. Watson mentioned that the CIA has been facing weird problems with their supercomputer, 'The Beast', recently.

This afternoon, Sherlock received a note from Moriarty, saying that he
has infected 'The Beast' with a virus. Moreover, the note had the number
N printed on it. After doing some calculations, Sherlock
figured out that the key to remove the virus is the largest 'Decent'
Number having N digits.

A 'Decent' Number has -
1. Only 3 and 5 as its digits.
2. Number of times 3 appears is divisible by 5.
3. Number of times 5 appears is divisible by 3.

Meanwhile, the counter to destruction of 'The Beast' is running very
fast. Can you save 'The Beast', and find the key before Sherlock?

Input Format
The 1st line will contain an integer T, the number of test cases, followed by T lines, each line containing an integer N i.e. the number of digits in the number

Output Format
Largest Decent number having N digits. If no such number exists, tell Sherlock that he is wrong and print '-1'

Constraints
1<=T<=20
1<=N<=100000

---

题解：

Java的String真是坑死爹啊，每次加入一个新的字符都要用O(N)的时间，所以如果不停的加入字符要用StringBuffer或者StringBuilder，要不就一直TLE。

代码如下：

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

 public class Solution {

     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         int t = in.nextInt();
         for(int i =0;i<t;i++){
             int n = in.nextInt();
             StringBuffer answer = new StringBuffer();
             for(int j = 0;j <= n/5;j++){
                 if((n-5*j)%3 == 0){
                     for(int k = 0;k< n-5*j;k++)
                         answer.append("5");
                     for(int k = 0;k < 5*j;k++)
                         answer.append("3");
                     System.out.println(answer.toString());
                     break;
                 }
             }
             if(answer.toString().equals(""))
                 System.out.println(-1);
         }
     }

 }