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
56 changes: 56 additions & 0 deletions leetcode3/곽현지/1348. Tweet Counts Per Frequency
Original file line number Diff line number Diff line change
@@ -0,0 +1,56 @@
// 시간복잡도 : O(N+K) => 저장된 트윗 N개를 모두 순회하고 결과 리스트(O(K))로 변환

class TweetCounts {
private Map<String, TreeMap<Integer, Integer>> tweetMap;

public TweetCounts() {
tweetMap = new HashMap<>();
}

// 트윗 기록
public void recordTweet(String tweetName, int time) {
tweetMap.putIfAbsent(tweetName, new TreeMap<>());
TreeMap<Integer, Integer> timeMap = tweetMap.get(tweetName);
timeMap.put(time, timeMap.getOrDefault(time, 0) + 1);
}

// 트윗 수 집계
public List<Integer> getTweetCountsPerFrequency(String freq, String tweetName, int startTime, int endTime) {
List<Integer> result = new ArrayList<>();
// 해당 트윗이 없을 경우 값 반환
if (!tweetMap.containsKey(tweetName)) {
return result;
}

int interval = 0;
// 조회 단위 설정
switch (freq) {
case "minute":
interval = 60;
break;
case "hour":
interval = 3600;
break;
case "day" :
interval = 86400;
break;
default:
throw new IllegalArgumentException("Invalid frequency");
}

TreeMap<Integer, Integer> timeMap = tweetMap.get(tweetName);
int start = startTime; // 시작 시간
while (start <= endTime) {
int end = Math.min(start + interval - 1, endTime);
int count = 0;

for (Map.Entry<Integer, Integer> entry : timeMap.subMap(start, true, end, true).entrySet()) {
count += entry.getValue();
}
result.add(count);
start += interval;
}

return result;
}
}
19 changes: 19 additions & 0 deletions leetcode3/곽현지/1536. Minimum Swaps to Arrange a Binary Grid
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
class Solution {
public int minSwaps(int[][] grid) {
int n = grid.size();
vector<int> v(n);
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= 0; j--) {
if (grid[i][j] == 1) {
v[i] = j;
break;
}
}
}

int cnt = 0;
for (int i = 0; i < n; i++) {

}
}
}
Loading