GitHub - jxnding/leetcode: Leetcode practice

Name		Name	Last commit message	Last commit date
.gitignore		.gitignore
01-matrix.py		01-matrix.py
3sum.py		3sum.py
4sum.py		4sum.py
ListNode.py		ListNode.py
TODO.md		TODO.md
a.out		a.out
add-strings.py		add-strings.py
add-two-numbers.py		add-two-numbers.py
alien-dictionary.py		alien-dictionary.py
array-partition-i.py		array-partition-i.py
best-time-to-buy-and-sell-stock-iii.py		best-time-to-buy-and-sell-stock-iii.py
best-time-to-buy-and-sell-stock.py		best-time-to-buy-and-sell-stock.py
binary-prefix-divisible-by-5.py		binary-prefix-divisible-by-5.py
binary-search-tree-iterator.py		binary-search-tree-iterator.py
binary-search.py		binary-search.py
binary-tree-inorder-traversal.cpp		binary-tree-inorder-traversal.cpp
binary-tree-inorder-traversal.py		binary-tree-inorder-traversal.py
binary-tree-maximum-path-sum.py		binary-tree-maximum-path-sum.py
binary-tree-pruning.py		binary-tree-pruning.py
brace-expansion-ii.py		brace-expansion-ii.py
cheapest-flights-within-k-stops.py		cheapest-flights-within-k-stops.py
check-completeness-of-a-binary-tree.py		check-completeness-of-a-binary-tree.py
coin-change-2.py		coin-change-2.py
combination_sum.py		combination_sum.py
count-negative-numbers-in-a-sorted-matrix.py		count-negative-numbers-in-a-sorted-matrix.py
count-odd-numbers-in-an-interval-range.py		count-odd-numbers-in-an-interval-range.py
count-partitions-with-even-sum-difference.py		count-partitions-with-even-sum-difference.py
count-the-number-of-houses-at-a-certain-distance-ii.py		count-the-number-of-houses-at-a-certain-distance-ii.py
course-schedule-ii.py		course-schedule-ii.py
cousins-in-binary-tree.py		cousins-in-binary-tree.py
critical-connections-in-a-network.py		critical-connections-in-a-network.py
cut-off-trees-for-golf-event.py		cut-off-trees-for-golf-event.py
daily-temperatures.py		daily-temperatures.py
decode-ways.py		decode-ways.py
defanging-an-ip-address.py		defanging-an-ip-address.py
delete-columns-to-make-sorted-ii.py		delete-columns-to-make-sorted-ii.py
delete-node-in-a-linked-list.py		delete-node-in-a-linked-list.py
duplicate-zeros.py		duplicate-zeros.py
employee-importance.py		employee-importance.py
equal-row-and-column-pairs.py		equal-row-and-column-pairs.py
excel-sheet-column-title.py		excel-sheet-column-title.py
exclusive-time-of-functions.py		exclusive-time-of-functions.py
filling-bookcase-shelves.py		filling-bookcase-shelves.py
find-all-numbers-disappeared-in-an-array.py		find-all-numbers-disappeared-in-an-array.py
find-peak-element.py		find-peak-element.py
find-triangular-sum-of-an-array.py		find-triangular-sum-of-an-array.py
find-words-that-can-be-formed-by-characters.py		find-words-that-can-be-formed-by-characters.py
first-letter-to-appear-twice.cpp		first-letter-to-appear-twice.cpp
first-letter-to-appear-twice.ts		first-letter-to-appear-twice.ts
first-missing-positive.py		first-missing-positive.py
first-unique-character-in-a-string.py		first-unique-character-in-a-string.py
flatten-binary-tree-to-linked-list.py		flatten-binary-tree-to-linked-list.py
flower-planting-with-no-adjacent.py		flower-planting-with-no-adjacent.py
friend-circles.py		friend-circles.py
fruit-into-baskets.py		fruit-into-baskets.py
greatest-common-divisor-of-strings.py		greatest-common-divisor-of-strings.py
hamming-distance.py		hamming-distance.py
interleaving-string.py		interleaving-string.py
interval-list-intersections.py		interval-list-intersections.py
invert-binary-tree.py		invert-binary-tree.py
is-graph-bipartite.py		is-graph-bipartite.py
jump-game.py		jump-game.py
k-closest-points-to-origin.py		k-closest-points-to-origin.py
k-items-with-the-maximum-sum.py		k-items-with-the-maximum-sum.py
kth-largest-element-in-an-array.py		kth-largest-element-in-an-array.py
largest-rectangle-in-histogram.c		largest-rectangle-in-histogram.c
largest-rectangle-in-histogram.py		largest-rectangle-in-histogram.py
letter-combinations-of-a-phone-number.py		letter-combinations-of-a-phone-number.py
license-key-formatting.py		license-key-formatting.py
linked-list-cycle-ii.py		linked-list-cycle-ii.py
linked-list-random-node.py		linked-list-random-node.py
longest-arithmetic-sequence.py		longest-arithmetic-sequence.py
longest-common-prefix.py		longest-common-prefix.py
longest-palindromic-substring.py		longest-palindromic-substring.py
longest-substring-without-repeating-characters.py		longest-substring-without-repeating-characters.py
longest-valid-parentheses.py		longest-valid-parentheses.py
magic-squares-in-grid.py		magic-squares-in-grid.py
majority-element-ii.py		majority-element-ii.py
majority-element.py		majority-element.py
make-sum-divisible-by-p.py		make-sum-divisible-by-p.py
max-points-on-a-line.py		max-points-on-a-line.py
maximize-the-minimum-powered-city.go		maximize-the-minimum-powered-city.go
maximize-the-minimum-powered-city.py		maximize-the-minimum-powered-city.py
maximum-product-subarray.py		maximum-product-subarray.py
maximum-running-time-of-n-computers.py		maximum-running-time-of-n-computers.py
maximum-width-of-binary-tree.py		maximum-width-of-binary-tree.py
median-of-two-sorted-arrays.py		median-of-two-sorted-arrays.py
merge-intervals.py		merge-intervals.py
merge-k-sorted-lists.py		merge-k-sorted-lists.py
merge-two-sorted-lists.py		merge-two-sorted-lists.py
middle-of-the-linked-list.py		middle-of-the-linked-list.py
minimum-area-rectangle.py		minimum-area-rectangle.py
minimum-cost-to-convert-string-i.py		minimum-cost-to-convert-string-i.py
minimum-operations-to-convert-all-elements-to-zero.py		minimum-operations-to-convert-all-elements-to-zero.py
minimum-operations-to-make-all-array-elements-equal.py		minimum-operations-to-make-all-array-elements-equal.py
minimum-path-sum.py		minimum-path-sum.py
minimum-penalty-for-a-shop.py		minimum-penalty-for-a-shop.py
most-common-word.py		most-common-word.py
my-calendar-ii.py		my-calendar-ii.py

Repository files navigation

class Solution:
    def licenseKeyFormatting(self, S: str, K: int) -> str:
        S = S.replace('-','').upper()
        leftover = len(S)%K
        if S=='': return ''
        
        ans = []
        for i in range(leftover):
            ans.append(S[i])
        if leftover>0:
            ans.append('-')
        for i in range(leftover,len(S),K):
            for j in range(i,i+K):
                ans.append(S[j])
            ans.append('-')
        del ans[-1]
        return ''.join(ans)

About

Leetcode practice

License

Activity

0 stars

1 watching

0 forks

Report repository

Navigation Menu

Repository files navigation

About

Releases

Packages

Used by

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

About

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages