μκ³ λ¦¬μ¦π
λ¬Έμ νμ΄[Queue] - λ°μ€ ν¬μ₯, λ¬Έμμ΄ λ³κ²½νκΈ°
Jeein0313
2023. 7. 18. 11:45
λ°μ€ ν¬μ₯
λ°μ€ ν¬μ₯μ μν΄ μΌλ ¬λ‘ μ μμ λ, λ·μ¬λμ΄ ν¬μ₯μ΄ λͺ¨λ λλλ μμ¬λμ ν¬μ₯μ κΈ°λ€λ €μΌ ν λ, μ΅λ λͺ λͺ μ΄ κ°μ΄ λκ° μ μλμ§λ₯Ό ꡬνλ λ¬Έμ .
public static int paveBox(int[] boxes){
//κ°μ΄ λκ° μ μλ μ¬λμ μ
List<Integer> listQueue = new ArrayList<>();
ArrayList<Integer> answerList = new ArrayList<>();
for(int i=0;i<boxes.length;i++){
listQueue.add(boxes[i]);
}
boolean isMax=false;
for(int i=0;i<listQueue.size();i++){
if(listQueue.get(0)<listQueue.get(i)){
isMax=true;
answerList.add(i);
listQueue = listQueue.subList(i, listQueue.size());
System.out.println(listQueue);
}
}
if(isMax==false){
answerList.add(listQueue.size());
}
return Collections.max(answerList);
}
λ¬Έμμ΄ λ³κ²½νκΈ°
public static String StringTransform(String str){
Queue<Character> queue = new LinkedList<>();
StringBuilder sb = new StringBuilder();
for(int i=0;i<str.length();i++){
queue.add(str.charAt(i));
}
while(!queue.isEmpty()){
sb.append(queue.poll());
if(!queue.isEmpty()){
queue.add(queue.poll());
}
}
return sb.toString();
}