leetCode
文章平均质量分 82
碰碰猪
华中科技大学自动化研究生
展开
-
leetCode练习(6)
题目:ZigZag Conversion难度:easy问题描述:The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better leg原创 2016-09-10 10:20:20 · 231 阅读 · 0 评论 -
leetCode练习(7)
标题:Reverse Integer难度:easy描述:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321 方法一:利用java的Integer to String,将int转为字符串来处理。原创 2016-09-10 13:04:04 · 224 阅读 · 0 评论 -
leetCode练习(9)
题目:Palindrome Number(回文数)(第九题)难度:easy问题描述:Determine whether an integer is a palindrome. Do this without extra space.判断一个int型数是不是回文数。思路如下:1.如果是负数,则不是回文数。2.若是正数,则有两种思路,一是将其转化为字符数组来出来,但这样需要额外的空原创 2016-09-11 15:43:11 · 221 阅读 · 0 评论 -
leetCode练习(2)
题目:Add Two Numbers 难度:medium 问题描述:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their no原创 2016-09-11 17:58:59 · 203 阅读 · 0 评论 -
leetCode练习(14)
题目:Longest Common Prefix难度:easy问题描述:Write a function to find the longest common prefix string amongst an array of strings.找出字符串数组中的最大公共前缀子串错误点:在未考虑String[] strs为null的情况下,直接调用strs[0].length,引原创 2016-09-12 09:36:13 · 220 阅读 · 0 评论 -
leetCode练习(3)
题目:Longest Substring Without Repeating Characters难度:medium问题描述:Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer i原创 2016-09-12 15:20:24 · 1137 阅读 · 0 评论 -
leetCode练习(4)
题目:Median of Two Sorted Arrays(第四题)难度:hard问题描述:There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complex原创 2016-09-12 20:07:17 · 224 阅读 · 0 评论 -
leetCode练习(19)
题目:Remove Nth Node From End of List难度:easy问题描述: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.原创 2016-09-13 09:56:41 · 289 阅读 · 0 评论 -
leetCode练习(18)
题目:Submission Details难度:medium问题描述:Given an array S of n integers, are there elements a,b, c, and d in S such that a + b +c + d = target? Find all unique quadruplets in the array which giv原创 2016-09-15 09:51:13 · 671 阅读 · 0 评论 -
leetCode练习(5)
题目:Longest Palindromic Substring难度:medium问题描述:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length ofS is 1000, and there exists one unique lon原创 2016-09-15 11:24:59 · 221 阅读 · 0 评论 -
leetCode练习(15)
题目:3Sum难度:medium问题描述:Given 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.解题思路:先对数组进行排序原创 2016-09-15 15:16:24 · 175 阅读 · 0 评论 -
leetCode练习(20)
题目:Valid Parentheses难度:easy问题描述:Given a string containing just the characters '(', ')','{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct原创 2016-09-16 20:22:14 · 900 阅读 · 0 评论 -
leetCode练习(21)
题目:Merge Two Sorted Lists难度:easy问题描述: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.将两个已经排列好的链表整合成原创 2016-09-16 21:37:53 · 290 阅读 · 0 评论 -
leetCode练习(16)
题目:3Sum Closest难度:medium问题描述:Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assu原创 2016-09-17 10:34:32 · 192 阅读 · 0 评论 -
leetCode练习(17)
题目:Letter Combinations of a Phone Number难度:medium问题描述:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like原创 2016-09-17 19:12:18 · 224 阅读 · 0 评论 -
leetCode练习(11)
题目:Container With Most Water难度:medium问题描述:Given n non-negative integers a1,a2, ..., an, where each represents a point at coordinate (i,ai). n vertical lines are drawn such that the two endpo原创 2016-09-18 18:42:34 · 286 阅读 · 0 评论 -
leetCode练习(24)
题目:Swap Nodes in Pairs难度:easy问题描述:Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algo原创 2016-09-18 19:22:14 · 163 阅读 · 0 评论 -
leetCode练习(22)
题目:Generate Parentheses难度:medium问题描述: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: [原创 2016-09-18 21:16:12 · 342 阅读 · 0 评论 -
leetCode练习(23)
题目:Merge k Sorted Lists难度:hard问题描述:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.将一个已经排序好的链表数组整合成一个新的排序好了的数组。解题思路:思路1:每次读出每个链表的头结点值lists原创 2016-09-19 11:20:13 · 593 阅读 · 0 评论 -
leetCode练习(25)
题目:Reverse Nodes in k-Group难度:hard问题描述:Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then lef原创 2016-09-19 15:33:04 · 163 阅读 · 0 评论 -
leetCode练习(26)
题目:Remove Duplicates from Sorted Array难度:easy问题描述:Given a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra原创 2016-09-19 16:14:48 · 1446 阅读 · 2 评论 -
leetCode练习(27)
题目:Remove Element难度:easy问题描述:Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do th原创 2016-09-19 16:43:36 · 236 阅读 · 0 评论 -
leetCode练习(28)
题目:Implement strStr()难度:easy问题描述:Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.解题思路:最简单的是暴力子字符串查找算法,在文本中任意一原创 2016-09-19 19:46:58 · 253 阅读 · 0 评论 -
leetCode练习(29)
题目:Divide Two Integers难度:medium问题描述:Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 解题思路:问题的难点在于,一是不能用乘号,除号和取模,那么做除法还能用什么~,一个是原创 2016-09-20 09:37:15 · 212 阅读 · 0 评论 -
leetCode练习(32)
题目:Longest Valid Parentheses难度:hard问题描述:Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the l原创 2016-09-22 20:42:31 · 243 阅读 · 0 评论 -
leetCode练习(36)
题目:Valid Sudoku难度:easy问题描述:Determine 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 charac原创 2016-09-23 01:00:32 · 192 阅读 · 0 评论 -
leetCode练习(51)
题目:N-Queens难度:hard问题描述:The n-queens puzzle is the problem of placing n queens on ann×n chessboard such that no two queens attack each other.Given an integer n, return all distinct soluti原创 2016-10-09 10:13:42 · 263 阅读 · 0 评论 -
leetCode练习(52)
题目:N-Queens II难度:hard问题描述:Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.解题思路:与 leetCode练习(51)基本一样。在此不原创 2016-10-09 10:39:16 · 374 阅读 · 0 评论 -
leetCode练习(53)
题目:Maximum Subarray难度:medium问题描述:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],原创 2016-10-09 16:39:18 · 256 阅读 · 0 评论 -
leetCode练习(37)
题目:Sudoku Solver难度:hard问题描述:Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one un原创 2016-09-23 22:01:34 · 216 阅读 · 0 评论 -
leetCode练习(30)
题目:Substring with Concatenation of All Words难度:hard问题描述:You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) ins th原创 2016-09-20 18:56:35 · 1643 阅读 · 1 评论 -
leetCode练习(31)
问题:Next Permutation难度:medium问题描述:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it m原创 2016-09-21 09:11:06 · 184 阅读 · 0 评论 -
leetCode练习(54)
题目:Spiral Matrix难度:medium问题描述:Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix: [ [ 1, 2,原创 2016-10-10 10:58:26 · 210 阅读 · 0 评论 -
leetCode练习(55)
题目:Jump Game难度:medium问题描述:Given 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原创 2016-10-10 14:20:36 · 702 阅读 · 0 评论 -
leetCode练习(38)
题目:Count and Say难度:easy问题描述:The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11.11 is read off as "two原创 2016-09-24 20:21:41 · 206 阅读 · 0 评论 -
leetCode练习(56)
题目:Merge Intervals难度:hard问题描述:Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18]. 解题思路:一道合并区间的问原创 2016-10-10 19:44:30 · 450 阅读 · 0 评论 -
leetCode练习(39)
题目:Combination Sum难度:medium问题描述:Given a set of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.The same repeated numbe原创 2016-09-25 09:24:54 · 240 阅读 · 0 评论 -
leetCode练习(35)
题目:Search Insert Position难度:medium问题描述: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原创 2016-09-21 21:48:16 · 348 阅读 · 0 评论 -
leetCode练习(34)
题目:Search for a Range难度:medium问题描述:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of原创 2016-09-21 23:13:01 · 264 阅读 · 0 评论 -
leetCode练习(57)
题目:Insert Interval难度:hard问题描述:Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted原创 2016-10-11 08:59:43 · 263 阅读 · 0 评论