주석 수정

Author: wh2per

Programmers/Lv3/Lv3_등굣길.cpp

@@ -7,7 +7,7 @@ int solution84(int m, int n, vector<vector<int>> puddles) {
 	int road[101][101] = { 0, };
 	int check[101][101] = { 0, };
 
-	for (int i = 0; i < puddles.size(); i++)			// ¹°Àº 0
+	for (int i = 0; i < puddles.size(); i++)			// ¹°Àº 0 
 		check[puddles[i][1]][puddles[i][0]] = -1;
 
 	road[1][0] = 1;

Programmers/Lv3/Lv3_디스크컨트롤러.cpp

@@ -15,7 +15,7 @@ using namespace std;
 	}
 };
 
-// SRF 스케줄링을 구현
+// SJF 스케줄링을 구현
 int solution76(vector<vector<int>> jobs) {
 	int answer = 0;
 	priority_queue <vector<int>, vector<vector<int>>, cmp1 > pq_len;

Programmers/Lv3/Lv3_베스트앨범.cpp

@@ -21,7 +21,7 @@ vector<int> solution75(vector<string> genres, vector<int> plays) {
 
 	for (int i = 0; i < plays.size(); i++) {
 		m.insert(make_pair(genres[i],make_pair(plays[i],i)));
-		if (sum.find(genres[i]) != sum.end()) { 				// ¾È¿¡ ÀÌ¹Ì ÀÖ´Ù¸é
+		if (sum.find(genres[i]) != sum.end()) { 				// ¾È¿¡ ÀÌ¹Ì ÀÖ´Ù¸é 
 			int val = sum.find(genres[i])->second;
 			sum.erase(sum.find(genres[i]));
 			sum.insert(make_pair(genres[i], val + plays[i]));

Programmers/Lv3/Lv3_이중우선순위큐.cpp

@@ -24,11 +24,11 @@ vector<int> solution77(vector<string> operations) {
 			l.sort();
 		}
 		else {
-			if (num == "1") {			// ÃÖ´ñ°ª »èÁ¦
+			if (num == "1") {			// ÃÖ´ñ°ª »èÁ¦ 
 				if(l.size()>0)
 					l.pop_back();
 			}
-			else {						// ÃÖ¼Ú°ª »èÁ¦
+			else {						// ÃÖ¼Ú°ª »èÁ¦ 
 				if (l.size() > 0)
 					l.pop_front();
 			}

Programmers/Lv3/Lv3_카카오프렌즈컬러링북.cpp

@@ -42,9 +42,3 @@ vector<int> solution93(int m, int n, vector<vector<int>> picture) {
 	answer[1] = max_size_of_one_area;
 	return answer;
 }
-
-int main() {
-	vector<vector<int>> picture = {{1, 1, 1, 0}, {1, 2, 2, 0}, {1, 0, 0, 1}, {0, 0, 0, 1}, {0, 0, 0, 3}, {0, 0, 0, 3}};
-	solution93(6,4,picture);
-	return 0;
-}