'분류 전체보기'에 해당되는 글 104건

10개에서 몇달째 늘지가 않네....-_ㅠ

문제 : http://59.23.113.171/pool/koi_reversal/koi_reversal.php?pname=koi_reversa

import java.util.Scanner;

public class Main {

public Main() {

// TODO Auto-generated constructor stub

int number[] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};

int input[] = new int[2];

Scanner scan = new Scanner(System.in);

for (int i = 0; i < 10; i++) {

for (int j = 0; j < 2; j++) {

input[j] = scan.nextInt();

}

sort(number,input);

}

print(number);

}

public void sort(int[] number, int[] input){

int count = 0;

if ((input[1]-input[0])%2 == 0) {

count = (input[1]-input[0])/2;

}else{

count = ((input[1]-input[0])/2)+1;

}

int a=0;

for (int i = 0; i < count; i++) {

int temp = number[input[0]-1+a];

number[input[0]-1+a] = number[input[1]-1-a];

number[input[1]-1-a] = temp; 

a++;

}

}

public void print(int[] number){

for (int i = 0; i < number.length; i++) {

System.out.print(number[i] + " ");

}

}

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

new Main();

}

}

프로그래머로 알고리즘은 필수사항!

알고리즘을 따로 공부하고 싶어 책을 구입하려던 참에.. 

www.dovelet.com 사이트를 알게 되었습니다 알고리즘 정보를 제공해주기때문에

전체적으로 한번씩 풀어서 정리하려 합니다. 그럼 알고리즘 세상으로!!

package queue;

public class Queue {

private int front;

private int rear;

private String[] dataAr;

private final int arrayMax = 10;

public Queue() {

// TODO Auto-generated constructor stub

dataAr = new String[arrayMax];

put("push1");

peek();

get();

put("push2");

peek();

get();

put("push3");

peek();

get();

put("push4");

peek();

get();

get();

get();

put("push5");

peek();

}

private boolean empty() {

// TODO Auto-generated method stub

if(front == rear){

System.out.println("비었을 경우 = Underflow");

return true;

}

return false;

}

//front 데이터 출력

private void peek() {

// TODO Auto-generated method stub

System.out.println("peek() : " +  dataAr[front] + "front : " + front + " rear : " + rear);

}

private void put(String temp) {

// TODO Auto-generated method stub

dataAr[rear] = temp;

rear++;

}

private void get() {

// TODO Auto-generated method stub

if(!empty()){

String get = dataAr[front];

System.out.println("삭제  : " + get);

front++;

}

}

}

package stack;

import java.util.Scanner;

import java.util.Vector;

public class Stack {

private int top =-1;

private Vector<String> vc = new Vector<String>();

public Stack() {

// TODO Auto-generated constructor stub

while(true){

String str = "";

System.out.println("1 : push , 2 : pop");

Scanner scan = new Scanner(System.in);

int k = scan.nextInt();

switch (k) {

case 1:

System.out.println(" 데이터 입력 ");

str = scan.next();

push(str);

peek();

break;

case 2:

peek();

pop();

break;

default:

break;

}

}

}

private void push(String data) {

// TODO Auto-generated method stub

vc.add(data);

top++;

}

private void pop() {

// TODO Auto-generated method stub

if(!empty()){

vc.remove(top);

top--;

}

}

private void peek() {

// TODO Auto-generated method stub

System.out.println("top : " + top);

if(!empty()){

String peek = vc.get(top);

System.out.println("peek : " + peek);

}else{

System.out.println("EmptyStackException");

}

}

private boolean empty() {

// TODO Auto-generated method stub

if (top < 0) {

return true;

}

return false;

}

}