-
-
Notifications
You must be signed in to change notification settings - Fork 249
[lhc0506] WEEK 1 solutions #1169
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.
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
Merged
Merged
Changes from all commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
61578ec
contains-duplicate solution
066d5ec
two-sum solution
db0e1ea
top-k-frequent-elements solution
61bb104
longest-consecutive-sequence solution
39f7e8e
house-robber solution
3c9ea58
house-robber add missing semi colon
a6a966b
refactor longest-consecutive-sequence
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,10 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @return {boolean} | ||
*/ | ||
var containsDuplicate = function(nums) { | ||
const numsSet = new Set(); | ||
nums.forEach(num => numsSet.add(num)); | ||
|
||
return nums.length !== numsSet.size; | ||
}; |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @return {number} | ||
*/ | ||
var rob = function(nums) { | ||
if (nums.length < 2) { | ||
return Math.max(nums); | ||
} | ||
|
||
let twoBefore = 0; | ||
let oneBefore = 0; | ||
|
||
nums.forEach(num => { | ||
const prevOneBefore = oneBefore; | ||
oneBefore = Math.max(prevOneBefore, twoBefore + num); | ||
twoBefore = prevOneBefore; | ||
}); | ||
|
||
return Math.max(oneBefore, twoBefore); | ||
}; |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,30 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @return {number} | ||
*/ | ||
|
||
var longestConsecutive = function(nums) { | ||
const numSet = new Set(nums); | ||
|
||
let maxLength = 0; | ||
let currentLength = 0; | ||
|
||
const countConsecutive = (num, step) => { | ||
let currentNum = num; | ||
while(numSet.has(currentNum)) { | ||
numSet.delete(currentNum); | ||
currentNum += step; | ||
currentLength += 1; | ||
} | ||
} | ||
|
||
nums.forEach(num => { | ||
countConsecutive(num, 1); | ||
countConsecutive(num - 1, -1); | ||
|
||
maxLength = Math.max(maxLength, currentLength); | ||
currentLength = 0; | ||
}); | ||
|
||
return maxLength; | ||
}; |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,14 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @param {number} k | ||
* @return {number[]} | ||
*/ | ||
var topKFrequent = function(nums, k) { | ||
const numsMap = {}; | ||
|
||
nums.forEach(num => { | ||
numsMap[num] ? numsMap[num] += 1 : numsMap[num] = 1; | ||
}); | ||
|
||
return Object.entries(numsMap).sort((a, b) => b[1] - a[1]).slice(0, k).map(([key]) => Number(key)); | ||
}; |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,18 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @param {number} target | ||
* @return {number[]} | ||
*/ | ||
var twoSum = function(nums, target) { | ||
const numsMap = {}; | ||
|
||
for (let i = 0; i < nums.length; i++) { | ||
const needNum = target - nums[i]; | ||
|
||
if (needNum in numsMap) { | ||
return [i, numsMap[needNum]]; | ||
} | ||
|
||
numsMap[nums[i]] = i; | ||
} | ||
}; |
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
변수 두개로 공간 복잡도를 줄이니 가독성이 좋네요 👏