leetcode
Healist
积极向上的小年轻,努力提高的小码农
展开
-
LeetCode刷题系列_43题
题目要求: Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative. Converting the input string to原创 2016-11-28 18:09:53 · 322 阅读 · 0 评论 -
LeetCode刷题系列_66题
题目要求: Given a non-negative number represented as an array of digits, > plus one to the number. The digits are stored such that the most significant digit is at the > head of the list.大致意思就是用一个数原创 2016-11-28 18:59:27 · 436 阅读 · 0 评论 -
LeetCode刷题系列_3题
题目要求: Given a string, find the length of the longest substring without repeating characters.Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer is原创 2016-11-29 22:14:03 · 372 阅读 · 0 评论 -
LeetCode刷题系列_5题
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 a valid answer.原创 2016-12-02 20:02:46 · 375 阅读 · 0 评论 -
LeetCode刷题系列_1题
题目要求: 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. Given nums = [2, 7, 11,原创 2016-11-25 10:54:48 · 419 阅读 · 0 评论 -
LeetCode刷题系列_15题
题目要求: 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.Note: The solution set must not contain原创 2016-11-25 13:56:12 · 447 阅读 · 0 评论 -
LeetCode刷题系列_16题
题目要求: 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 assume that each input would have e原创 2016-11-25 16:43:29 · 356 阅读 · 0 评论 -
LeetCode刷题系列_2题
题目要求: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as原创 2016-11-28 16:53:33 · 358 阅读 · 0 评论