随笔分类 -  LeetCode

上一页 1 ··· 30 31 32 33 34 35 36 37 38 ··· 61 下一页
摘要:There's a tree, a squirrel, and several nuts. Positions are represented by the cells in a 2D grid. Your goal is to find the minimal distance for the s 阅读全文
posted @ 2017-05-30 10:52 Grandyang 阅读(3400) 评论(0) 推荐(0) 编辑
摘要:LeetCode wants to give one of its best employees the option to travel among N cities to collect algorithm problems. But all work and no play makes Jac 阅读全文
posted @ 2017-05-29 23:58 Grandyang 阅读(9243) 评论(13) 推荐(0) 编辑
摘要:Given an integer n, find the closest integer (not including itself), which is a palindrome. The 'closest' is defined as absolute difference minimized 阅读全文
posted @ 2017-05-28 11:30 Grandyang 阅读(8069) 评论(1) 推荐(0) 编辑
摘要:Given the coordinates of four points in 2D space, return whether the four points could construct a square. The coordinate (x,y) of a point is represen 阅读全文
posted @ 2017-05-27 23:33 Grandyang 阅读(5790) 评论(2) 推荐(0) 编辑
摘要:Given a 01 matrix M, find the longest line of consecutive one in the matrix. The line could be horizontal, vertical, diagonal or anti-diagonal. Exampl 阅读全文
posted @ 2017-05-24 20:35 Grandyang 阅读(8324) 评论(3) 推荐(0) 编辑
摘要:We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1. Now, given an integer arra 阅读全文
posted @ 2017-05-23 23:33 Grandyang 阅读(5806) 评论(2) 推荐(0) 编辑
摘要:Given a list of strings, you could concatenate these strings together into a loop, where for each string you could choose to reverse it or not. Among 阅读全文
posted @ 2017-05-22 01:39 Grandyang 阅读(5772) 评论(0) 推荐(1) 编辑
摘要:Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4. However, you can add any 阅读全文
posted @ 2017-05-21 23:44 Grandyang 阅读(4672) 评论(2) 推荐(0) 编辑
摘要:Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array wil 阅读全文
posted @ 2017-05-19 06:21 Grandyang 阅读(11575) 评论(6) 推荐(1) 编辑
摘要:Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer may b 阅读全文
posted @ 2017-05-17 11:41 Grandyang 阅读(8776) 评论(7) 推荐(0) 编辑
摘要:Given a binary tree, you need to find the length of Longest Consecutive Path in Binary Tree. Especially, this path can be either increasing or decreas 阅读全文
posted @ 2017-05-16 23:56 Grandyang 阅读(8836) 评论(2) 推荐(0) 编辑
摘要:Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies following conditions: where we define that subarray ( 阅读全文
posted @ 2017-05-14 23:43 Grandyang 阅读(8712) 评论(7) 推荐(0) 编辑
摘要:You are given several boxes with different colors represented by different positive numbers. You may experience several rounds to remove boxes until t 阅读全文
posted @ 2017-05-13 22:16 Grandyang 阅读(12788) 评论(7) 推荐(1) 编辑
摘要:Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th 阅读全文
posted @ 2017-05-12 23:34 Grandyang 阅读(4811) 评论(1) 推荐(0) 编辑
摘要:Given a binary tree, return the values of its boundary in anti-clockwise direction starting from root. Boundary includes left boundary, leaves, and ri 阅读全文
posted @ 2017-05-10 00:17 Grandyang 阅读(12266) 评论(1) 推荐(0) 编辑
摘要:Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a 阅读全文
posted @ 2017-05-09 01:01 Grandyang 阅读(12656) 评论(0) 推荐(1) 编辑
摘要:During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, like make the rank 1 team play with the rank nth  阅读全文
posted @ 2017-05-08 22:48 Grandyang 阅读(5524) 评论(0) 推荐(0) 编辑
摘要:Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below. Example: Not 阅读全文
posted @ 2017-05-06 21:37 Grandyang 阅读(9368) 评论(6) 推荐(0) 编辑
摘要:Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's permutati 阅读全文
posted @ 2017-05-05 22:45 Grandyang 阅读(12166) 评论(1) 推荐(0) 编辑
摘要:Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Input:nums = 阅读全文
posted @ 2017-05-04 22:46 Grandyang 阅读(25615) 评论(9) 推荐(1) 编辑

上一页 1 ··· 30 31 32 33 34 35 36 37 38 ··· 61 下一页
Fork me on GitHub