LeetCode - 随笔分类(第36页) - Grandyang

[LeetCode] Freedom Trail 自由之路

摘要：In the video game Fallout 4, the quest "Road to Freedom" requires players to reach a metal dial called the "Freedom Trail Ring", and use the dial to s 阅读全文

posted @ 2017-04-06 22:52 Grandyang 阅读(5977) 评论(7) 推荐(0)

[LeetCode] Longest Uncommon Subsequence I 最长非共同子序列之一

摘要：Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defi 阅读全文

posted @ 2017-04-04 22:47 Grandyang 阅读(7462) 评论(5) 推荐(0)

[LeetCode] Complex Number Multiplication 复数相乘

摘要：Given two strings representing two complex numbers. You need to return a string representing their multiplication. Note i2 = -1 according to the defin 阅读全文

posted @ 2017-04-03 01:18 Grandyang 阅读(3532) 评论(0) 推荐(1)

[LeetCode] 493. Reverse Pairs 翻转对

摘要：Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j]. You need to return the number of important reverse pai 阅读全文

posted @ 2017-04-02 00:00 Grandyang 阅读(19219) 评论(11) 推荐(0)

[LeetCode] Super Washing Machines 超级洗衣机

摘要：You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty. For each move, you could choose any m (1 ≤ 阅读全文

posted @ 2017-03-30 21:12 Grandyang 阅读(7272) 评论(6) 推荐(0)

[LeetCode] Perfect Number 完美数字

摘要：We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself. Now, given an integer n, write 阅读全文

posted @ 2017-03-28 21:07 Grandyang 阅读(7735) 评论(4) 推荐(0)

[LeetCode] 483. Smallest Good Base 最小的好基数

摘要：For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1. Now given a string representing n, you should return the smallest go 阅读全文

posted @ 2017-03-26 06:08 Grandyang 阅读(6724) 评论(3) 推荐(0)

[LeetCode] Sliding Window Median 滑动窗口中位数

摘要：Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two 阅读全文

posted @ 2017-03-26 06:05 Grandyang 阅读(14645) 评论(1) 推荐(0)

[LeetCode] Diameter of Binary Tree 二叉树的直径

摘要：Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath betwee 阅读全文

posted @ 2017-03-23 21:03 Grandyang 阅读(18029) 评论(12) 推荐(0)

[LeetCode] 542. 01 Matrix 零一矩阵

摘要：Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Input: 阅读全文

posted @ 2017-03-22 21:49 Grandyang 阅读(19697) 评论(10) 推荐(2)

[LeetCode] 538. Convert BST to Greater Tree 将二叉搜索树BST转为较大树

摘要：Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus 阅读全文

posted @ 2017-03-20 20:49 Grandyang 阅读(10529) 评论(7) 推荐(1)

[LeetCode] Reverse String II 翻转字符串之二

摘要：Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there ar 阅读全文

posted @ 2017-03-19 23:22 Grandyang 阅读(8149) 评论(0) 推荐(0)

[LeetCode] Minimum Time Difference 最短时间差

摘要：Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list. Examp 阅读全文

posted @ 2017-03-17 21:20 Grandyang 阅读(5941) 评论(4) 推荐(0)

[LeetCode] Encode and Decode TinyURL 编码和解码精简URL地址

摘要：TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http 阅读全文

posted @ 2017-03-16 23:14 Grandyang 阅读(11206) 评论(7) 推荐(0)

[LeetCode] 532. K-diff Pairs in an Array 数组中差为K的数对

摘要：Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an inte 阅读全文

posted @ 2017-03-13 21:10 Grandyang 阅读(11245) 评论(2) 推荐(0)

[LeetCode] Minimum Absolute Difference in BST 二叉搜索树的最小绝对差

摘要：Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Note: There are at 阅读全文

posted @ 2017-03-12 23:17 Grandyang 阅读(8763) 评论(2) 推荐(0)

[LeetCode] Minesweeper 扫雷游戏

摘要：Let's play the minesweeper game (Wikipedia, online game)! You are given a 2D char matrix representing the game board. 'M' represents an unrevealed min 阅读全文

posted @ 2017-03-11 23:41 Grandyang 阅读(10156) 评论(3) 推荐(2)

[LeetCode] Beautiful Arrangement 优美排列

摘要：Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of t 阅读全文

posted @ 2017-03-10 21:57 Grandyang 阅读(10500) 评论(1) 推荐(2)

[LeetCode] 525. Contiguous Array 相连的数组

摘要：Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Input: [0,1] Output: 2 Explanation: [0 阅读全文

posted @ 2017-03-10 11:41 Grandyang 阅读(12656) 评论(5) 推荐(0)

[LeetCode] 524. Longest Word in Dictionary through Deleting 删除后得到的字典中的最长单词

摘要：Given a string s and a string array dictionary, return the longest string in the dictionary that can be formed by deleting some of the given string ch 阅读全文

posted @ 2017-03-08 22:08 Grandyang 阅读(8273) 评论(3) 推荐(0)

Grandyang

仰天长啸仗剑红尘，冬去春来寒暑几更...

随笔分类 - LeetCode

公告