LeetCode
XiangYida
这个作者很懒,什么都没留下…
展开
-
在二叉树的每一行中找到最大的值。
示例:输入: 1 / \ 3 2 / \ \ 5 3 9 输出: [1, 3, 9]/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNod...原创 2018-07-24 16:40:04 · 1233 阅读 · 0 评论 -
LeetCode(61)-Rotate List
61. Rotate ListGiven a linked list, rotate the list to the right by k places, where k >is non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5->1->2-&g...原创 2018-11-01 19:15:49 · 69 阅读 · 0 评论 -
LeetCode(41)-First Missing Positive
41-Submission DetailGiven an unsorted integer array, find the smallest missing positive integer.Example 1:Input: [1,2,0]Output: 3Example 2:Input: [3,4,-1,1]Output: 2Example 3:Input: [7,8,9,1...原创 2018-11-01 19:49:22 · 160 阅读 · 0 评论 -
LeetCode(70)-Climbing Stairs
70-Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps.In how many distinct ways can you climb to the top?Note: Given n ...原创 2018-11-04 23:53:10 · 95 阅读 · 0 评论 -
LeetCode(19)-Remove Nth Node From End of List
19. Remove Nth Node From End of ListGiven a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removi...原创 2018-11-05 00:49:27 · 115 阅读 · 0 评论 -
LeetCode(35)-Search Insert Position
35. Search Insert PositionGiven 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 assume no...原创 2018-11-05 01:07:11 · 112 阅读 · 0 评论 -
LeetCode(69)-Sqrt(x)
69. Sqrt(x)Implement int sqrt(int x).Compute and return the square root of x, where x is guaranteed to be a non-negative integer.Since the return type is an integer, the decimal digits are truncat...原创 2018-11-13 00:54:51 · 204 阅读 · 0 评论 -
LeetCode(55)-Jump Game
55. Jump GameGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.De...原创 2018-11-08 00:34:39 · 127 阅读 · 0 评论 -
LeetCode(100)-Same Tree
100. Same TreeGiven 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 have the same v...原创 2018-11-08 08:24:52 · 89 阅读 · 0 评论 -
LeetCode(63)-Unique Paths II
63. Unique Paths IIA robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is tr...原创 2018-11-12 00:47:03 · 90 阅读 · 0 评论 -
LetCode(21)-Merge Two Sorted Lists
21. Merge Two Sorted ListsMerge 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: 1->2->4,...原创 2018-11-06 07:41:31 · 88 阅读 · 0 评论 -
LeetCode(58)-Length of Last Word
58. Length of Last WordGiven 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, return 0...原创 2018-11-01 10:24:19 · 109 阅读 · 0 评论 -
LeetCode(18)-4S
SubmissionDetailGiven an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gi...原创 2018-11-01 00:27:06 · 89 阅读 · 0 评论 -
Z字形变换
将字符串 "PAYPALISHIRING" 以Z字形排列成给定的行数: P A H N A P L S I I G Y I R 之后从左往右,逐行读取字符:"PAHNAPLSIIGYIR" 实现一个将字符串进行指定行数变换的函数: string convert(string s, int numRows); 示例 1...原创 2018-07-30 12:16:40 · 1441 阅读 · 0 评论 -
反转整数
给定一个 32 位有符号整数,将整数中的数字进行反转。示例 1:输入: 123输出: 321 示例 2:输入: -123输出: -321示例 3:输入: 120输出: 21想了一个简单的思路,没有去考虑耗时。能在最快的时间写出来只要能通过测试就行了,先不考虑那么多吧 public int reverse(int x) { String stri...原创 2018-08-01 19:23:17 · 194 阅读 · 0 评论 -
回文数
判断一个整数是否是回文数。回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。示例 1:输入: 121输出: true示例 2:输入: -121输出: false解释: 从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。示例 3:输入: 10输出: false解释: 从右向左读, 为 01 。因此它不是一个回文...原创 2018-08-07 11:05:51 · 14381 阅读 · 0 评论 -
LeetCode(17)-Letter Combinations of a Phone Number
17.Letter Combinations of a Phone NumberGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (j...原创 2018-10-25 21:59:24 · 244 阅读 · 0 评论 -
LeetCode(16)-3Sum Closest
16. 3Sum ClosestGiven an array nums of n integers and an integer target, find three >integers in nums such that the sum is closest to target. Return the >sum of the three integers. You may ass...原创 2018-10-25 23:22:44 · 102 阅读 · 0 评论 -
LeetCode(53)-Maximum Subarray
Maximum SubarrayGiven an integer array nums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Outp...原创 2018-10-29 22:49:37 · 162 阅读 · 0 评论 -
LeetCode(90)-SubsetII
90-Subset IIGiven a collection of integers that might contain duplicates, nums, return allpossible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input...原创 2018-10-31 14:48:55 · 155 阅读 · 0 评论 -
LeetCode(22)-Generate Parentheses
22. Generate ParenthesesGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[“((()))”,“(()())”,“((...原创 2018-11-15 15:24:50 · 171 阅读 · 0 评论