08 2019 档案
摘要：题目如下： A transaction is possibly invalid if: the amount exceeds $1000, or; if it occurs within (and including) 60 minutes of another transaction with t
阅读全文
摘要：题目如下： Let's define a function f(s) over a non-empty string s, which calculates the frequency of the smallest character in s. For example, if s = "dcce
阅读全文
摘要：题目如下： Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences. After doin
阅读全文
摘要：题目如下： Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on F
阅读全文
摘要：题目如下： Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: The flattened tree should look like: 解题思路：递归，从
阅读全文
摘要：题目如下： Implement a basic calculator to evaluate a simple expression string. The expression string contains only non-negativeintegers, +, -, *, / operat
阅读全文
摘要：题目如下： Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an
阅读全文
摘要：题目如下： We are given hours, a list of the number of hours worked per day for a given employee. A day is considered to be a tiring day if and only if the
阅读全文
摘要：题目如下： Given an array nums of integers, a move consists of choosing any element and decreasing it by 1. An array A is a zigzag array if either: Every e
阅读全文
摘要：题目如下： Write a query identifying the type of each record in the TRIANGLES table using its three side lengths. Output one of the following statements fo
阅读全文
摘要：题目如下： Consider and to be two points on a 2D plane. happens to equal the minimum value in Northern Latitude (LAT_N in STATION). happens to equal the mi
阅读全文
摘要：题目如下： You are given three tables: Students, Friends and Packages. Students contains two columns: ID and Name. Friends contains two columns: ID and Fri
阅读全文
摘要：题目如下： You have d dice, and each die has f faces numbered 1, 2, ..., f. Return the number of possible ways (out of fd total ways) modulo 10^9 + 7 to ro
阅读全文
摘要：题目如下： Given a string text, we are allowed to swap two of the characters in the string. Find the length of the longest substring with repeated characte
阅读全文
摘要：题目如下： Given a string date representing a Gregorian calendar date formatted as YYYY-MM-DD, return the day number of the year. Example 1: Example 2: Exa
阅读全文
摘要：题目如下： You are given an array of strings words and a string chars. A string is good if it can be formed by characters from chars (each character can on
阅读全文
摘要：题目如下： Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level X such that th
阅读全文
摘要：题目如下： Given an N x N grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to
阅读全文
摘要：题目如下： Given a string s, return the last substring of s in lexicographical order. Example 1: Example 2: Note: 解题思路：我的方法是找出s中的最大字符max_char，然后以max_char为分
阅读全文
摘要：题目如下： Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated fr
阅读全文
摘要：题目如下： Return the largest possible k such that there exists a_1, a_2, ..., a_k such that: Each a_i is a non-empty string; Their concatenation a_1 + a_2
阅读全文
摘要：题目如下： Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the giv
阅读全文
摘要：题目如下： On an alphabet board, we start at position (0, 0), corresponding to character board[0][0]. Here, board = ["abcde", "fghij", "klmno", "pqrst", "u
阅读全文
摘要：题目如下： The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2for n >= 0. Given n, return the value of Tn
阅读全文
摘要：题目如下： Consider a directed graph, with nodes labelled 0, 1, ..., n-1. In this graph, each edge is either red or blue, and there could be self-edges or
阅读全文
摘要：题目如下： Given two arrays of integers with equal lengths, return the maximum value of: |arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j| where the maxi
阅读全文
浙公网安备 33010602011771号