seyjs - 博客园

2019年7月4日

【leetcode】1104. Path In Zigzag Labelled Binary Tree

摘要：题目如下： In an infinite binary tree where every node has two children, the nodes are labelled in row order. In the odd numbered rows (ie., the first, thi 阅读全文

posted @ 2019-07-04 11:17 seyjs 阅读(536) 评论(0) 推荐(0) 编辑

【leetcode】1103. Distribute Candies to People

摘要：题目如下： We distribute some number of candies, to a row of n = num_people people in the following way: We then give 1 candy to the first person, 2 candie 阅读全文

posted @ 2019-07-04 11:06 seyjs 阅读(506) 评论(0) 推荐(0) 编辑

2019年6月28日

【leetcode】1074. Number of Submatrices That Sum to Target

摘要：题目如下： 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 阅读(740) 评论(0) 推荐(0) 编辑

2019年6月24日

【leetcode】1095. Find in Mountain Array

摘要：题目如下： (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 阅读(629) 评论(0) 推荐(0) 编辑

【leetcode】1094. Car Pooling

摘要：题目如下： 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 阅读(570) 评论(0) 推荐(0) 编辑

【leetcode】1093. Statistics from a Large Sample

摘要：题目如下： 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 阅读(508) 评论(0) 推荐(0) 编辑

2019年6月18日

【leetcode】1091. Shortest Path in Binary Matrix

摘要：题目如下： 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 阅读(880) 评论(0) 推荐(0) 编辑

【leetcode】1043. Partition Array for Maximum Sum

摘要：题目如下： 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 阅读(264) 评论(0) 推荐(0) 编辑

【leetcode】1090. Largest Values From Labels

摘要：题目如下： 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 阅读(467) 评论(0) 推荐(0) 编辑

【leetcode】1089. Duplicate Zeros

摘要：题目如下： 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 阅读(677) 评论(0) 推荐(0) 编辑

公告