Leetcode 每日一题
nobleman__
加油王先生
展开
-
2017.10.17 LeetCode 172. Factorial Trailing Zeroes 258. Add Digits 268. Missing Number 【数论小知识】
172. Factorial Trailing ZeroesDescriptionGiven an integer n, return the number of trailing zeroes in n!n!.Note:Your solution should be in logarithmic time complexity. 题意: 让你求n的阶乘后面有几个零 分析:题意很简单,我们知道n原创 2017-10-17 16:48:23 · 513 阅读 · 0 评论 -
2017.10.26 LeetCode 581. Shortest Unsorted Continuous Subarray
581. Shortest Unsorted Continuous SubarrayUser Accepted: 834 User Tried: 1041 Total Accepted: 848 Total Submissions: 3254 Difficulty: EasyGiven an integer array, you need to find one continuous sub原创 2017-10-26 15:00:31 · 347 阅读 · 0 评论 -
2017.11.3 LeetCode - 101. Symmetric Tree
101. Symmetric TreeDescriptionGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 题意: 判断一个树是否是对称的分原创 2017-11-03 21:30:23 · 268 阅读 · 0 评论 -
2017.11.4 LeetCode - 78. Subsets 【DFS】
78. SubsetsDescriptionGiven a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.For example, If nums = [1,2,3], a so原创 2017-11-04 21:20:51 · 320 阅读 · 0 评论 -
2017.11.14 LeetCode - 118. Pascal's Triangle - 119. Pascal's Triangle II
最近很忙,又有期中考试,事偏多,耽误了几天,下次一定要注意,加油!118. Pascal’s TriangleDescriptionGiven numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,原创 2017-11-14 20:20:34 · 270 阅读 · 0 评论 -
2017.11.5 LeetCode - 104. Maximum Depth of Binary Tree 【dfs的应用】
104. Maximum Depth of Binary TreeDescriptionGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node原创 2017-11-06 18:32:37 · 331 阅读 · 0 评论 -
2017.11.21 LeetCode - Weekly Contest 59 - Self Dividing Numbers - My Calendar I
728. Self Dividing Numbers A self-dividing number is a number that is divisible by every digit it contains.For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 ==原创 2017-11-21 20:55:49 · 372 阅读 · 0 评论 -
2017.11.22 LeetCode - 532. K-diff Pairs in an Array【简单二分】
532. K-diff Pairs in an ArrayDescriptionGiven 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 integer pair (i原创 2017-11-22 22:09:56 · 294 阅读 · 0 评论 -
2017.12.25 LeetCode 633. Sum of Square Numbers【思维枚举】
633. Sum of Square NumbersDescriptionGiven a non-negative integer c, your task is to decide whether there’re two integers a and b such thata2+b2=c. a^2 + b^2 = c.Example 1:Input: 5 Output: True Expla原创 2017-12-25 21:36:34 · 312 阅读 · 0 评论 -
2017.12.25 LeetCode 645. Set Mismatch 【思维查找】
645. Set MismatchDescriptionThe set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which原创 2017-12-25 22:47:19 · 343 阅读 · 0 评论 -
2017.12.18 LeetCode - 198. House Robber【dp入门】
198. House RobberDescriptionYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of原创 2017-12-18 19:48:35 · 292 阅读 · 0 评论 -
2018.1.13 LeetCode 31. Next Permutation 46. Permutations【STL -> 全排列】
31. Next PermutationDescriptionImplement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must re原创 2018-01-13 15:44:07 · 302 阅读 · 0 评论 -
2018.1.13 LeetCode 47. Permutations II 60. Permutation Sequence 【STL简单应用】
47. Permutations IIDescriptionGiven a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations:原创 2018-01-13 15:50:35 · 323 阅读 · 0 评论 -
2018.1.8 LeetCode 21. Merge Two Sorted Lists 【链表的基本运用】
21. Merge Two Sorted ListsDescriptionMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input:原创 2018-01-08 15:09:11 · 255 阅读 · 0 评论 -
2018.2.11 LeetCode 100. Same Tree【递归】
100. Same TreeDescriptionGiven two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes h...原创 2018-02-11 11:42:54 · 235 阅读 · 0 评论 -
2018.2.11 LeetCode 572. Subtree of Another Tree 【递归】
572. Subtree of Another TreeDescriptionGiven 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 tree c...原创 2018-02-11 12:38:18 · 324 阅读 · 0 评论 -
2018.2.13 LeetCode 415. Add Strings 【大数加法模拟】
415. Add StringsDescriptionGiven two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is < 5100. Both num1...原创 2018-02-13 14:08:37 · 309 阅读 · 0 评论 -
2017.10.25 LeetCode - 15. 3Sum【Two Pointers】
15. 3SumDescriptionGiven an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must原创 2017-10-26 12:34:39 · 368 阅读 · 0 评论 -
2017.11.2 LeetCode - 70. Climbing Stairs - 100. Same Tree - 717. 1-bit and 2-bit Characters
717. 1-bit and 2-bit CharactersWe have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).Now given a string rep原创 2017-11-02 21:35:25 · 318 阅读 · 0 评论 -
2017.10.16 LeetCode 231. Power of Two 342. Power of Four 326. Power of Three【数论小知识】
231. Power of TwoDescriptionGiven an integer, write a function to determine if it is a power of two.题意: 给你一个int类型的数n,问你n是不是2的某次幂分析:首先n必须得大于等于0,然后有个很基础的位运算可以来判定 就是让n&(n-1),看看这个值是否为0,因为我们知道一个数n与上(n-1)如果原创 2017-10-16 20:00:35 · 470 阅读 · 0 评论 -
2017.10.18 LeetCode 7. Reverse Integer 1. Two Sum 【数论小知识】
7. Reverse IntegerDescriptionReverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to show spoilers.Note:The input is assumed to be a 32-bit signed integer. Y原创 2017-10-18 21:19:27 · 442 阅读 · 0 评论 -
2017.10.19 LeetCode 二分 -> 69. Sqrt(x) -> 410. Split Array Largest Sum
69. Sqrt(x)DescriptionImplement int sqrt(int x).Compute and return the square root of x.题意:让你求x√\sqrt x 分析: 直接二分即可,注意好边界条件即可class Solution {public: bool check(int x,int mid){ if(mid*1ll*m原创 2017-10-19 11:50:55 · 464 阅读 · 0 评论 -
2017.10.27 LeetCode - 14. Longest Common Prefix
14. Longest Common PrefixDescriptionWrite a function to find the longest common prefix string amongst an array of strings.题意: 让你求出字符串数组中最长公共前缀并输出分析: 直接拿第一个字符串来和后面的进行比较如果对应的每位都相等的话那么就在最后的答案里加上这个字符,详细见函数原创 2017-10-27 16:40:59 · 444 阅读 · 0 评论 -
2017.10.28 LeetCode - 20. Valid Parentheses - 112. Path Sum
20. Valid ParenthesesDescriptionGiven a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()”原创 2017-10-28 17:35:43 · 412 阅读 · 0 评论 -
2017.10.20 LeetCode Two Pointers 26. 27.
26. Remove Duplicates from Sorted ArrayDescriptionGiven a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for原创 2017-10-21 09:38:03 · 440 阅读 · 0 评论 -
2017.10.21 LeetCode - 13. Roman to Integer - 28. Implement strStr()
28. Implement strStr()DescriptionImplement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.题意: 让你实现在c语言中的strstr函数,给你两个字符串string haysta原创 2017-10-21 13:59:12 · 444 阅读 · 0 评论 -
2017.10.29 LeetCode - 113. Path Sum II【DFS的运用】【补】
附:由于昨天去外地参加比赛,耽误了,补上~113. Path Sum IIDescriptionGiven a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example: Given the below binary tree and sum =原创 2017-10-30 13:18:25 · 396 阅读 · 0 评论 -
2017.10.30 LeetCode - 167. Two Sum II - Input array is sorted 【手写+upper_bound】
167. Two Sum II - Input array is sortedDescriptionGiven an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function t原创 2017-10-30 20:08:29 · 448 阅读 · 0 评论 -
2017.10.22 LeetCode - 35. Search Insert Position - 66. Plus One
35. Search Insert PositionDescriptionGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may as原创 2017-10-23 13:23:01 · 502 阅读 · 0 评论 -
2017.10.31 LeetCode - 58. Length of Last Word 【ctype.h的简单运用与总结】
58. Length of Last WordDescriptionGiven a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string.If the last word does not exist, r原创 2017-10-31 19:47:36 · 735 阅读 · 0 评论 -
2017.11.8 LeetCode N皇后问题 - 51. N-Queens - 52....
前两天课多,也在学搜索这一块,终于把N皇后问题给彻彻底底的搞懂了51. N-QueensDescriptionThe n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, ret原创 2017-11-08 13:44:02 · 391 阅读 · 0 评论 -
2017.11.9 LeetCode - 111. Minimum Depth of Binary Tree 【递归妙用 + bfs】
111. Minimum Depth of Binary TreeDescriptionGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node原创 2017-11-09 14:18:36 · 283 阅读 · 0 评论 -
2017.10.23 LeetCode - 67. Add Binary【思维】
67. Add BinaryDescriptionGiven two binary strings, return their sum (also a binary string).For example,a = “11” b = “1” Return “100”. 题意: 给你两个二进制的字符串,让你返回二进制的和分析 : 也可以暴力的模拟枚举各种情况,但是太复杂了,还得考虑进位的情况,一开原创 2017-10-24 13:31:13 · 272 阅读 · 0 评论 -
2017.10.24 LeetCode 88. Merge Sorted Array 【思维呀】
88. Merge Sorted ArrayDescriptionGiven two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equ原创 2017-10-24 20:15:57 · 420 阅读 · 0 评论 -
2017.11.1 LeetCode - 653. Two Sum IV - Input is a BST
653. Two Sum IV - Input is a BSTDescriptionGiven a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target. 题意: 给你个二原创 2017-11-01 19:01:51 · 305 阅读 · 0 评论 -
开启 LeetCode & Nowcoder 每日一题
最近看了不少人都在准备面试题啥的,想着我也从现在开始准备点货,虽然有点晚了,以备不时只需吧,以后尽量每天会最少刷一道 LeetCode 或 牛客 上的题,毕竟大多数都是经典面试题,2017.10.16开始,走起吧,有兴趣的小伙伴一起呀原创 2017-10-16 19:22:42 · 421 阅读 · 0 评论 -
LeetCode Weekly Contest 74 793. Preimage Size of Factorial Zeroes Function【二分】
793. Preimage Size of Factorial Zeroes Function Let f(x) be the number of zeroes at the end of x!. (Recall that x! = 1 * 2 * 3 * … * x, and by convention, 0! = 1.)For example, f(3) = 0 because 3! ...原创 2018-03-04 17:57:24 · 573 阅读 · 0 评论