We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 03f0f27 commit 7db66ddCopy full SHA for 7db66dd
house-robber/renovizee.java
@@ -1,6 +1,8 @@
1
2
+// tag renovizee 1week unresolved
3
// https://github.com/DaleStudy/leetcode-study/issues/264
4
// https://leetcode.com/problems/house-robber/
5
+// DP 자체에 대한 설명 : https://www.youtube.com/watch?v=0bqfTzpWySY
6
class Solution {
7
public int rob(int[] nums) {
8
top-k-frequent-elements/renovizee.java
@@ -1,7 +1,9 @@
// https://github.com/DaleStudy/leetcode-study/issues/237
// https://leetcode.com/problems/top-k-frequent-elements/
+
public int[] topKFrequent(int[] nums, int k) {
int[] result = {1, 2, 3};
9
0 commit comments