摘要： 题目如下： Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and 阅读全文

摘要： 题目如下： Given an array of integers A, a move consists of choosing any A[i], and incrementing it by 1. Return the least number of moves to make every val 阅读全文

摘要： 题目如下： Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The 阅读全文

摘要： 题目如下： We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each stri 阅读全文

摘要： 题目如下： Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length. Return any permutation A of [0, 1, ..., N] such that for 阅读全文

摘要： 题目如下： Given an array A of integers, return true if and only if it is a valid mountain array. Recall that A is a mountain array if and only if: A.lengt 阅读全文

摘要： 题目如下： You have an array of logs. Each log is a space delimited string of words. For each log, the first word in each log is an alphanumeric identifier 阅读全文

摘要： 题目如下： In a given 2D binary array A, there are two islands. (An island is a 4-directionally connected group of 1s not connected to any other 1s.) Now, 阅读全文

摘要： 题目如下： A chess knight can move as indicated in the chess diagram below: . This time, we place our chess knight on any numbered key of a phone pad (indi 阅读全文

摘要： 题目如下： Given a square array of integers A, we want the minimum sum of a falling path through A. A falling path starts at any element in the first row, 阅读全文