11 2018 档案

【leetcode】187. Repeated DNA Sequences
摘要：题目如下： All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes usef 阅读全文
posted @ 2018-11-28 15:50 seyjs 阅读(160) 评论(0) 推荐(0)
【leetcode】688. Knight Probability in Chessboard
摘要：题目如下： On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly K moves. The rows and columns are 0 indexed, 阅读全文
posted @ 2018-11-27 22:01 seyjs 阅读(144) 评论(0) 推荐(0)
【leetcode】576. Out of Boundary Paths
摘要：题目如下： There is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross the grid boun 阅读全文
posted @ 2018-11-27 14:25 seyjs 阅读(196) 评论(0) 推荐(0)
【leetcode】947. Most Stones Removed with Same Row or Column
摘要：题目如下： On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone. Now, a move consists of remo 阅读全文
posted @ 2018-11-26 16:42 seyjs 阅读(801) 评论(0) 推荐(0)
【leetcode】948. Bag of Tokens
摘要：题目如下： You have an initial power P, an initial score of 0 points, and a bag of tokens. Each token can be used at most once, has a value token[i], and h 阅读全文
posted @ 2018-11-26 15:24 seyjs 阅读(516) 评论(0) 推荐(0)
【leetcode】946. Validate Stack Sequences
摘要：题目如下： 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 阅读全文
posted @ 2018-11-25 22:44 seyjs 阅读(318) 评论(0) 推荐(0)
【leetcode】945. Minimum Increment to Make Array Unique
摘要：题目如下： 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 阅读全文
posted @ 2018-11-25 20:05 seyjs 阅读(317) 评论(0) 推荐(0)
【leetcode】662. Maximum Width of Binary Tree
摘要：题目如下： 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 阅读全文
posted @ 2018-11-22 16:35 seyjs 阅读(247) 评论(0) 推荐(0)
【leetcode】944. Delete Columns to Make Sorted
摘要：题目如下： 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 阅读全文
posted @ 2018-11-19 14:10 seyjs 阅读(343) 评论(0) 推荐(0)
【leetcode】942. DI String Match
摘要：题目如下： 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 阅读全文
posted @ 2018-11-19 14:05 seyjs 阅读(676) 评论(0) 推荐(0)
【leetcode】941. Valid Mountain Array
摘要：题目如下： 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 阅读全文
posted @ 2018-11-19 13:58 seyjs 阅读(439) 评论(0) 推荐(0)
【leetcode】937. Reorder Log Files
摘要：题目如下： 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 阅读全文
posted @ 2018-11-14 14:59 seyjs 阅读(373) 评论(0) 推荐(0)
【leetcode】934. Shortest Bridge
摘要：题目如下： 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, 阅读全文
posted @ 2018-11-06 15:30 seyjs 阅读(718) 评论(0) 推荐(0)
【leetcode】935. Knight Dialer
摘要：题目如下： 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 阅读全文
posted @ 2018-11-05 19:58 seyjs 阅读(805) 评论(0) 推荐(0)