Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
1 change: 1 addition & 0 deletions combination-sum/sora0319.java
Original file line number Diff line number Diff line change
Expand Up @@ -24,3 +24,4 @@ private void checkTarget(int[] candidates, int target, int start, List<List<Inte
}
}


1 change: 1 addition & 0 deletions decode-ways/sora0319.java
Original file line number Diff line number Diff line change
Expand Up @@ -22,3 +22,4 @@ public int numDecodings(String s) {
}
}


1 change: 1 addition & 0 deletions maximum-subarray/sora0319.java
Original file line number Diff line number Diff line change
Expand Up @@ -16,3 +16,4 @@ public int maxSubArray(int[] nums) {

}


1 change: 1 addition & 0 deletions number-of-1-bits/sora0319.java
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Integer.toBinaryString이라는 함수를 쓸 수 있다는 건 생각지도 못했네요. 또 새로운 거 배워 갑니다!

Original file line number Diff line number Diff line change
Expand Up @@ -10,3 +10,4 @@ public int hammingWeight(int n) {
}
}


1 change: 1 addition & 0 deletions valid-palindrome/sora0319.java
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

역시 대부분 start와 end 인덱스를 따로 둔 상태로 푸시는군요... java에서는 charAt을 쓸 수 있는 건 생각 못했네요!
새로운 풀이 배워갑니다.

Original file line number Diff line number Diff line change
Expand Up @@ -25,3 +25,4 @@ public boolean isPalindrome(String s) {
}
}