06 2019 档案

摘要:题目如下: Given a matrix, and a target, return the number of non-empty submatrices that sum to target. A submatrix x1, y1, x2, y2 is the set of all cells  阅读全文
posted @ 2019-06-28 11:33 seyjs 阅读(755) 评论(0) 推荐(0)
摘要:题目如下: (This problem is an interactive problem.) You may recall that an array A is a mountain array if and only if: A.length >= 3 There exists some i w 阅读全文
posted @ 2019-06-24 09:57 seyjs 阅读(641) 评论(0) 推荐(0)
摘要:题目如下: You are driving a vehicle that has capacity empty seats initially available for passengers. The vehicle only drives east (ie. it cannot turn aro 阅读全文
posted @ 2019-06-24 09:48 seyjs 阅读(576) 评论(0) 推荐(0)
摘要:题目如下: We sampled integers between 0 and 255, and stored the results in an array count: count[k] is the number of integers we sampled equal to k. Retur 阅读全文
posted @ 2019-06-24 09:44 seyjs 阅读(516) 评论(0) 推荐(0)
摘要:题目如下: In an N by N square grid, each cell is either empty (0) or blocked (1). A clear path from top-left to bottom-right has length k if and only if i 阅读全文
posted @ 2019-06-18 13:49 seyjs 阅读(889) 评论(0) 推荐(0)
摘要:题目如下: Given an integer array A, you partition the array into (contiguous) subarrays of length at most K. After partitioning, each subarray has their v 阅读全文
posted @ 2019-06-18 13:44 seyjs 阅读(272) 评论(0) 推荐(0)
摘要:题目如下: We have a set of items: the i-th item has value values[i] and label labels[i]. Then, we choose a subset S of these items, such that: |S| <= num_ 阅读全文
posted @ 2019-06-18 13:34 seyjs 阅读(473) 评论(0) 推荐(0)
摘要:题目如下: Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements 阅读全文
posted @ 2019-06-18 13:25 seyjs 阅读(687) 评论(0) 推荐(0)
摘要:题目如下: Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the 阅读全文
posted @ 2019-06-15 06:18 seyjs 阅读(426) 评论(0) 推荐(0)
摘要:题目如下: Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.) A node i 阅读全文
posted @ 2019-06-15 06:14 seyjs 阅读(508) 评论(0) 推荐(0)
摘要:题目如下: Given a matrix consisting of 0s and 1s, we may choose any number of columns in the matrix and flip every cell in that column. Flipping a cell ch 阅读全文
posted @ 2019-06-15 06:08 seyjs 阅读(434) 评论(0) 推荐(0)
摘要:题目如下: You have a set of tiles, where each tile has one letter tiles[i]printed on it. Return the number of possible non-empty sequences of letters you 阅读全文
posted @ 2019-06-15 06:00 seyjs 阅读(821) 评论(0) 推荐(0)
摘要:题目如下: Return the lexicographically smallest subsequence of text that contains all the distinct characters of text exactly once. Example 1: Example 2: 阅读全文
posted @ 2019-06-15 05:57 seyjs 阅读(436) 评论(0) 推荐(0)
摘要:题目如下: Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, an 阅读全文
posted @ 2019-06-11 16:47 seyjs 阅读(406) 评论(0) 推荐(0)
摘要:题目如下: Given two numbers arr1 and arr2 in base -2, return the result of adding them together. Each number is given in array format: as an array of 0s a 阅读全文
posted @ 2019-06-11 16:27 seyjs 阅读(387) 评论(0) 推荐(0)
摘要:题目如下: For strings S and T, we say "T divides S" if and only if S = T + ... + T (T concatenated with itself 1 or more times) Return the largest string  阅读全文
posted @ 2019-06-10 09:58 seyjs 阅读(480) 评论(0) 推荐(0)