C++

題目

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part.

題目

In a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the ith domino. (A domino is a tile with two numbers from 1 to 6 - one on each half of the tile.)

… Read More »LeetCode: 895-Maximum Frequency Stack 解題紀錄

題目

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.

題目

題目

… Read More »LeetCode: 138-Copy List with Random Pointer 解題紀錄

題目

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.

題目