LeetCode: 316-Remove Duplicate Letters 解題紀錄
題目
Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.
Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.
Given a balanced parentheses string s, return the score of the string.
Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well.
Read More »LeetCode: 82-Remove Duplicates from Sorted List II 解題紀錄Given an integerRead More »LeetCode: 383-Counting Bits 解題紀錄n, return an arrayansof lengthn + 1such that for eachi(0 <= i <= n),ans[i]is the number of1's in the binary representation ofi.
Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in the graph contains a value (Read More »LeetCode: 133-Clone Graph 解題思路int) and a list (List[Node]) of its neighbors.