Skip to content
Open
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
14 changes: 14 additions & 0 deletions HamSungJun/Solution_1047.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
function removeDuplicates (s: string): string {
const letterStack: string[] = []
for (let i = 0; i < s.length; i++) {
const letter = s[i]
if (letter === letterStack[letterStack.length - 1]) {
letterStack.pop()
continue
}
letterStack.push(letter)
}
return letterStack.join('')
};

console.log(removeDuplicates('caabbdaabbz'))
16 changes: 16 additions & 0 deletions HamSungJun/Solution_1356.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
function sortByBits (arr: number[]): number[] {
const numBitsArr = arr.map(num => {
return {
num,
numBits: num.toString(2).split('').filter(bit => bit === '1').length
}
})
numBitsArr.sort((a, b) => {
if (a.numBits !== b.numBits) {
return Number(a.numBits > b.numBits) - Number(a.numBits < b.numBits)
} else {
return Number(a.num > b.num) - Number(a.num < b.num)
}
})
return numBitsArr.map(item => item.num)
};
15 changes: 15 additions & 0 deletions HamSungJun/Solution_1880.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
function isSumEqual (firstWord: string, secondWord: string, targetWord: string): boolean {
return wordToNum(firstWord) + wordToNum(secondWord) === wordToNum(targetWord)
};

function wordToNum (word: string): number {
let out = ''
for (let i = 0; i < word.length; i++) {
const nextDigit = word[i].charCodeAt(0) - 97
if (out.length === 0 && nextDigit === 0) {
continue
}
out += nextDigit
}
return +out
}