(Java)프로그래머스 코딩테스트 연습 - 탐욕법(Greedy) - 구명보트

1. 문제

https://programmers.co.kr/learn/courses/30/lessons/42885#qna

코딩테스트 연습 - 구명보트

2. 나의 풀이

import java.util.Arrays;

class Solution {
    public int solution(int[] people, int limit) {
        int answer = 0;
        Arrays.sort(people);
        int left = 0;
        int right = people.length - 1;
        while(right >= left) {
        	int weight = people[right--];
        	if(weight + people[left] <= limit) {
        		left++;
        	}
        	answer++;
        }
        /*
        //System.out.println(Arrays.toString(people));
        int people_su = people.length;
        System.out.println(people_su);
        boolean [] visited = new boolean [people_su];
        int k = limit;
        while(visited_check(visited)) {
        	for(int i = (people_su - 1); i >= 0; i = i - 1) {
        		if(visited[i] == false && k - people[i] >= 0) {
        			visited[i] = true;
        			k = k - people[i];
        		}
        	}
        	answer += 1;
        	k = limit;
        	System.out.println("visited : " + Arrays.toString(visited));
        	System.out.println("answer : " + answer);
        }
        */
        return answer;
    }
}

3. 다른 사람 풀이

import java.util.Arrays;

class Solution {
    public int solution(int[] people, int limit) {
        Arrays.sort(people);
        int i = 0, j = people.length - 1;
        for (; i < j; --j) {
            if (people[i] + people[j] <= limit)
                ++i;
        }
        return people.length - i;
    }
}