LeetCode
nuttee
这个作者很懒,什么都没留下…
展开
-
LeetCode Easy Palindrome Number
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.Example 1Input: 121Output: trueExample 2Input: -121Output: falseExplanation:...原创 2019-01-11 13:32:00 · 109 阅读 · 0 评论 -
LeetCode Easy Same Tree
Given 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 value.Example 1...原创 2019-01-13 11:15:29 · 124 阅读 · 0 评论 -
LeetCode Easy Search Insert Position
Given 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 duplicates in the array.Ex...原创 2019-01-13 11:15:48 · 111 阅读 · 0 评论 -
LeetCode Easy 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 truncated and only t...原创 2019-01-13 11:16:07 · 127 阅读 · 0 评论 -
LeetCode Easy Valid Parenthese
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of bra...原创 2019-01-13 11:16:28 · 165 阅读 · 0 评论 -
LeetCode LinkedList 总结
All solutions below were implemented in C++19 Remove Nth Node From End of Listhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/description/Given a linked list, remove the n-th node fr...原创 2019-01-14 21:35:54 · 284 阅读 · 0 评论 -
LeetCode Hard Number of Squareful Arrays
title: LeetCode Hard Number of Squareful Arraysdate: 2019-02-26 22:00:00categories:- LeetCodeGiven an array A of non-negative integers, the array is squareful if for every pair of adjacent eleme...原创 2019-02-27 15:08:40 · 204 阅读 · 0 评论 -
LeetCode Medium Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.Example:Input: "aab"Output:[ ["aa","b"], ["a","a","b&q原创 2019-02-25 10:12:56 · 132 阅读 · 0 评论 -
LeetCode Medium 3Sum
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution set must not contai...原创 2019-03-05 15:06:22 · 116 阅读 · 0 评论 -
LeetCode Medium Genertate Parenthese
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())", ...原创 2019-02-27 10:21:04 · 140 阅读 · 0 评论 -
LeetCode Medium Swaps To Make Sequences Increasing
We have two integer sequences A and B of the same non-zero length.We are allowed to swap elements A[i] and B[i]. Note that both elements are in the same index position in their respective sequences....原创 2019-03-08 16:25:58 · 152 阅读 · 0 评论 -
LeetCode Medium Longest Palindromeic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example 1:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.Example...原创 2019-03-04 14:57:05 · 102 阅读 · 0 评论 -
LeetCode Easy To Lower Case
Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase.Example 1:Input: "Hello"Output: "hello"Example 2:Input: "here"Output: "here"Example ...原创 2019-03-04 15:09:59 · 103 阅读 · 0 评论 -
LeetCode Medium String to Integer(atoi)
Implement atoi which converts a string to an integer.The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this...原创 2019-03-04 19:19:39 · 148 阅读 · 0 评论 -
LeetCode Easy Roman to Integer
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2019-01-13 11:15:13 · 179 阅读 · 1 评论 -
LeetCode Easy Remove Element
Given an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the input array...原创 2019-01-13 11:14:57 · 138 阅读 · 0 评论 -
LeetCode Easy Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.Example 1Input: 1->1->2Output: 1->2Example 2Input: 1->1->2->3->3Output: 1->2-&g...原创 2019-01-13 11:14:38 · 117 阅读 · 0 评论 -
LeetCode Easy Reverse Integer
Given a 32-bit signed integer, reverse digits of an integer.Example 1Input: 123Output: 321Example 2Input: -123Output: -321Example 3Input: 120Output: 21Note:Assume we are dealing with an ...原创 2019-01-11 13:32:43 · 128 阅读 · 0 评论 -
LeetCode Easy Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same e...原创 2019-01-11 13:33:05 · 128 阅读 · 0 评论 -
LeetCode Easy Add Binary
Given two binary strings, return their sum (also a binary string).The input strings are both non-empty and contains only characters 1 or 0.Example 1Input: a = "11", b = "1"Output: "100"Example 2...原创 2019-01-12 21:34:22 · 116 阅读 · 0 评论 -
LeetCode Easy Climbing Stairs
You 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 will be a positive i...原创 2019-01-12 21:34:49 · 104 阅读 · 0 评论 -
LeetCode Easy Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.11 is read off as...原创 2019-01-12 21:35:12 · 159 阅读 · 0 评论 -
LeetCode Easy Implement strStr()
Implement strStr().Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Example 1Input: haystack = "hello", needle = "ll"Output: 2Example 2Inp...原创 2019-01-12 21:36:10 · 109 阅读 · 0 评论 -
LeetCode Easy Length of Last Word
Given 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.Note: A word is defined...原创 2019-01-12 21:36:32 · 105 阅读 · 0 评论 -
LeetCode Easy Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "".Example 1Input: ["flower","flow","flight"]Output: "fl"...原创 2019-01-12 21:38:36 · 150 阅读 · 0 评论 -
LeetCode Easy Maximum Subarray
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.ExampleInput: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanation: ...原创 2019-01-12 21:39:12 · 99 阅读 · 0 评论 -
LeetCode Easy Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:The number of elements initialized in nums1 and nums2 are m and n respectively.You may assume that n...原创 2019-01-12 21:39:37 · 138 阅读 · 0 评论 -
LeetCode Easy Merge Two Sorted Lists
Merge 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.ExampleInput: 1->2->4, 1->3->4Output: 1->...原创 2019-01-12 21:39:58 · 116 阅读 · 0 评论 -
LeetCode Easy Plus One
Given a non-empty array of digits representing a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each element ...原创 2019-01-12 21:40:16 · 106 阅读 · 0 评论 -
LeetCode Easy Remove Duplicates from Sorted Array
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this by modifyin...原创 2019-01-13 11:14:02 · 121 阅读 · 0 评论 -
LeetCode Medium Add Two Numbers-II
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return i...原创 2019-03-07 16:36:07 · 117 阅读 · 0 评论