[HodaeSsi] Week3 #804
Merged
[HodaeSsi] Week3 #804
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
@HodaeSsi 님 요번 주도 수고 많으셨습니다. |
donghyeon95
approved these changes
Dec 28, 2024
| # 시간복잡도: O(1) (32bit) | ||
| class Solution: | ||
| def reverseBits(self, n: int) -> int: | ||
| return int(bin(n)[2:].zfill(32)[::-1], 2) |
There was a problem hiding this comment.
말씀하신 파이썬의 위대함인 것 같습니다 ㅎㅎ
엄청 간단하게 풀리네요
| for combination in dp[num - candidate]: | ||
| temp = combination.copy() | ||
| temp.extend([candidate]) | ||
| dp[num].append(temp) |
There was a problem hiding this comment.
모든 합 경우에서 조합 구하는 방식으로 풀면 되는 거군요.
저는 시간이 많이 걸릴 것 같아서 target을 쪼개는 방식으로 했는데,
중복을 제거 하는 게 좀 힘들었던 거 같습니다 ㅜㅜ
좋은 풀이 잘 봤습니다.
There was a problem hiding this comment.
요즘 정형화된 알고리즘 및 자료구조로 안풀린다 싶으면 바로 DP를 생각해보는 방식으로 해보고 있긴 합니다!
| if idx == 0: | ||
| prefix[idx] = nums[idx] | ||
| else: | ||
| prefix[idx] = prefix[idx - 1] * nums[idx] |
There was a problem hiding this comment.
이거는 사소한 거지만, 반복문에서 1부터 시작하면 조건문이 생략될 수 있지 않을까 합니다
| for i, num in enumerate(nums): | ||
| if target - num in seen: | ||
| return [seen[target - num], i] | ||
| seen[num] = i |
There was a problem hiding this comment.
되게 가독성 높은 풀이인 거 같습니다.
같은 방법인데 자바로 깔끔하게 풀려면 어떻게 해야 할까요?
There was a problem hiding this comment.
import java.util.HashMap;
import java.util.Map;
class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> seen = new HashMap<>(); // {num: idx, ...}
for (int i = 0; i < nums.length; i++) {
int complement = target - nums[i];
if (seen.containsKey(complement)) {
return new int[] {seen.get(complement), i};
}
seen.put(nums[i], i);
}
return new int[] {}; // 적절한 결과가 없으면 빈 배열 반환
}
}
*이 코드는 gpt에 의해 작성된 코드입니다. 😉
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
답안 제출 문제
체크 리스트
In Review로 설정해주세요.