LeetCode
文章平均质量分 75
iyangdi
这个作者很懒,什么都没留下…
展开
-
Google/LintCode:M-图是否是树
题目题目来源:Link给出 n 个节点,标号分别从 0 到 n - 1 并且给出一个 无向 边的列表 (给出每条边的两个顶点), 写一个函数去判断这张`无向`图是否是一棵树 注意事项你可以假设我们不会给出重复的边在边的列表当中. 无向边 [0, 1] 和 [1, 0] 是同一条边, 因此他们不会同时出现在我们给你的边的列表当中。原创 2017-08-10 11:27:02 · 362 阅读 · 0 评论 -
LeetCode:M-36. Valid Sudoku
LinkDetermine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A p原创 2017-09-05 22:01:30 · 266 阅读 · 0 评论 -
LeetCode:M-139. Word Break
LeetCode链接Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictiona原创 2017-09-25 13:40:02 · 397 阅读 · 0 评论 -
LeetCode:M-279. Perfect Squares
LeetCode链接Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 =原创 2017-09-25 14:57:13 · 315 阅读 · 0 评论 -
LeetCode:M-105. Construct Binary Tree from Preorder and Inorder Traversal
LeetCode链接Given preorder and inorder traversal of a tree, construct the binary tree./** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left;原创 2017-09-25 22:44:30 · 382 阅读 · 0 评论 -
LeetCode:M-287. Find the Duplicate Number
LeetCode链接Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one原创 2017-09-25 17:12:56 · 303 阅读 · 0 评论 -
LeetCode:M-547. Friend Circles
LeetCode链接There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direc原创 2017-09-25 17:48:57 · 386 阅读 · 0 评论 -
LeetCode:M-560. Subarray Sum Equals K
LeetCode链接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 = [1,1,1], k = 2Output: 2原创 2017-09-10 10:48:47 · 281 阅读 · 0 评论 -
LeetCode:M-2. Add Two Numbers
LeetCode链接You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the tw原创 2017-09-10 20:12:50 · 235 阅读 · 0 评论 -
LeetCode:M-5. Longest Palindromic Substring
LeetCode链接Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also原创 2017-09-10 22:42:05 · 205 阅读 · 0 评论 -
LeetCode:M-19. Remove Nth Node From End of List
LeetCode链接Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second no原创 2017-09-10 21:05:47 · 217 阅读 · 0 评论 -
LeetCode:M-142. Linked List Cycle II
LeetCode链接Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up:Can you solve it without usin原创 2017-09-10 19:26:04 · 210 阅读 · 0 评论 -
LeetCode:M-3 Sum
LeetCode链接1、数组排序2、左边固定一个指针,遍历3、右边两个移动指针4、三个指针指向的值求和判断5、a配对的b/c可能有多个,所以需要将b/c的指针均移动到下一个和b/c不同的值处TC = O(n^2)class Solution { public List> threeSum(int[] nums) { List> r原创 2017-09-11 10:24:55 · 170 阅读 · 0 评论 -
LeetCode:M-236. Lowest Common Ancestor of a Binary Tree
LeetCode链接Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is define原创 2017-09-11 11:22:00 · 171 阅读 · 0 评论 -
LeetCode:M-565. Array Nesting
LeetCode链接A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range [0, N - 1].Sets S[K] for 0 S[K] = { A[K], A[A[K]], A[A[A[K]原创 2017-09-13 13:12:34 · 295 阅读 · 0 评论 -
LeetCode:M-200. Number of Islands
LeetCode链接Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vert原创 2017-09-13 11:25:09 · 253 阅读 · 0 评论 -
LeetCode Graph:M210. Course Schedule II
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a原创 2017-08-05 09:07:46 · 210 阅读 · 0 评论 -
LeetCode Graph:M310. Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini原创 2017-08-05 10:36:09 · 243 阅读 · 0 评论 -
LeetCode Graph:M207_Course_Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as原创 2017-08-04 22:27:34 · 201 阅读 · 0 评论 -
Google/LintCode:M-寻找峰值
题目题目来源:Link你给出一个整数数组(size为n),其具有以下特点:相邻位置的数字是不同的A[0] A[n - 1]假定P是峰值的位置则满足A[P] > A[P-1]且A[P] > A[P+1],返回数组中任意一个峰值的位置。 注意事项数组可能包含多个峰值,只需找到其中的任何一个即可您在真实的面试中原创 2017-08-11 14:23:55 · 300 阅读 · 0 评论 -
LeetCode Graph:M332. Reconstruct Itinerary
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus原创 2017-08-05 15:47:13 · 241 阅读 · 0 评论 -
LeetCode Graph:M399. Evaluate Division
Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If the answ原创 2017-08-05 18:50:10 · 290 阅读 · 0 评论 -
LeetCode Graph:M133_Clone_Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each原创 2017-08-04 22:38:53 · 193 阅读 · 0 评论 -
LeetCode:M59. Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [原创 2017-08-05 19:27:02 · 214 阅读 · 0 评论 -
Google算法题:M-求二叉搜索树的第K小的数
http://www.jiuzhang.com/article/Google%202016%E5%B9%B412%E6%9C%88SDE%E7%94%B5%E9%9D%A2%E9%9D%A2%E7%BB%8F/给出一个二叉搜索树,写出一个方法,求出树中的第k小的数//中序遍历-递归int k;public int findTheKth(TreeNode root原创 2017-08-21 11:02:09 · 598 阅读 · 0 评论 -
Google算法题:H-Shortest Palindrome
http://www.jiuzhang.com/article/Google%202016%E5%B9%B412%E6%9C%88%20SDE%20Onsite%E9%9D%A2%E7%BB%8F/https://leetcode.com/problems/shortest-palindrome/description/Given a string S, you a原创 2017-08-21 23:04:06 · 262 阅读 · 0 评论 -
LintCode:M-Sort List
LintCode链接ort a linked list in O(n log n) time using constant space complexity.Have you met this question in a real interview? YesExampleGiven 1->3->2->null, so原创 2017-08-25 18:33:31 · 199 阅读 · 0 评论 -
Google面试题:M-Fraction to Recurring Decimal
http://www.jiuzhang.com/article/Google2014Experience%20%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B%E5%B8%88onsite%EF%BC%883%EF%BC%89/http://www.lintcode.com/zh-cn/problem/add-operators/Given tw原创 2017-08-22 17:13:26 · 297 阅读 · 0 评论 -
LeetCode:M-583. Delete Operation for Two Strings
LeetCode链接Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.Ex原创 2017-09-13 11:02:07 · 370 阅读 · 0 评论 -
LeetCode:M-647. Palindromic Substrings
LeetCode链接given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different subst原创 2017-09-11 11:50:49 · 388 阅读 · 0 评论