03 2019 档案
摘要：Given a balanced parentheses string , compute the score of the string based on the following rule: has score 1 has score , where A and B are balanced
阅读全文
摘要：In an exam room, there are N seats in a single row, numbered 0, 1, 2, ..., N-1. When a student enters the room, they must sit in the seat that maximiz
阅读全文
摘要：cars are going to the same destination along a one lane road. The destination is miles away. Each car has a constant speed (in miles per hour), and in
阅读全文
摘要：Let's call an array a mountain if the following properties hold: There exists some Given an array that is definitely a mountain, return any such that
阅读全文
摘要：In a group of N people (labelled `0, 1, 2, ..., N-1`), each person has different amounts of money, and different levels of quietness. For convenience,
阅读全文
摘要：In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least
阅读全文
摘要：There are piles of stones arranged in a row. The th pile has stones. A move consists of merging exactly consecutive piles into one pile, and the cost
阅读全文
摘要：We have a string S of lowercase letters, and an integer array shifts. Call the shift of a letter, the next letter in the alphabet, (wrapping around so
阅读全文
摘要：Alice has a hand of cards, given as an array of integers. Now she wants to rearrange the cards into groups so that each group is size W, and consists
阅读全文
摘要：Let's call any (contiguous) subarray B (of A) a mountain if the following properties hold: B.length >= 3 There exists some 0 < i < B.length - 1 such t
阅读全文
