Skip to content

[0621] Programmers_ko #38

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
naryeong-ko wants to merge 2 commits into
base: main
Choose a base branch
from
Open

[0621] Programmers_ko #38

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
bbece39
220621_solve : 나머지가 1이 되는 수 찾기_ko
naryeong-ko Jun 21, 2022
8a2afb5
220621_solve : 짝지어 제거하기_ko
naryeong-ko Jun 21, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions 0621/Programmers/Lv1/나머지가 1이 되는 수 찾기_ko.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
class Solution {
public int solution(int n) {
for (int i = 2; i < n; i++) {
if (n % i == 1)
return i;
}
return -1;
}
}
20 changes: 20 additions & 0 deletions 0621/Programmers/Lv2/짝지어 제거하기_ko.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
import java.util.Stack;

class Solution {
public int solution(String s) {
Stack<Character> stack = new Stack<>();

for (char c : s.toCharArray()) {
if (stack.isEmpty())
stack.push(c);
else if (stack.peek() == c)
stack.pop();
else
stack.push(c);
}

if (!stack.isEmpty())
return 0;
return 1;
}
}