c++
T-Rainbow
欢迎来到“菜鸟”驿站!
展开
-
第八周作业1(LeetCode3)
1. 题目描述(LeetCode3)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 i原创 2017-04-19 16:09:26 · 197 阅读 · 0 评论 -
第12周作业2(LeetCoed26)
1. 题目描述Given 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 another array, you must do this in place wi原创 2017-05-18 16:54:57 · 219 阅读 · 0 评论 -
第11周作业1(LeetCode31)
1. 题目描述Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possib原创 2017-05-18 19:57:52 · 220 阅读 · 0 评论 -
第12周作业1(LeetCode35)
1. 题目描述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 arra原创 2017-05-17 16:25:24 · 190 阅读 · 0 评论 -
第13周作业2(LeetCode22)
1. 题目描述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:[ “((()))”, “(()())”,原创 2017-05-27 23:54:20 · 313 阅读 · 0 评论 -
第13周作业1(LeetCode20)
1. 题目描述 Valid ParenthesesGiven a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “原创 2017-05-27 23:25:45 · 228 阅读 · 0 评论 -
第10周作业2(LeetCode2)
1. 题目描述You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and re原创 2017-05-17 09:54:05 · 191 阅读 · 0 评论 -
第10周作业1(LeetCode1)
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, and you may not use the s原创 2017-05-16 15:50:47 · 183 阅读 · 0 评论 -
第九周作业1(LeetCode14)
1. 题目描述Write a function to find the longest common prefix string amongst an array of strings.2. 解决思路我们知道字符串前缀的定义是不包括该字符串最后一个字符的其他字符的有序组合,但在这道题中,最长的公共前缀应该可以包括最后一个字符,相当于前缀加空字符串(而且这个对算法不影响)。所以这道题我主要的解题思路就原创 2017-05-15 17:35:25 · 206 阅读 · 0 评论 -
第八周作业2(LeetCode6)
1. 题目描述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 legibility)P A H N A P L S原创 2017-04-21 17:28:19 · 252 阅读 · 0 评论 -
第五周作业1(LeetCode50)
1. 题目描述 Implement pow(x, n).Hide Tags :Binary Search ,Math2. 解决思路 我的解题方法主要是利用递归和二分,具体就是把x的n次方划分成两个x的n/2次方相乘,然后递归求解子问题,结束条件是n为0返回1。因为是对n进行二分,所以算法复杂度是O(logn)。3. 完整代码#include <stdio.h>#include <stdlib.原创 2017-03-25 22:24:10 · 236 阅读 · 0 评论 -
第三周作业1(LeetCode53)
1. 题目描述 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], the contiguous subarray [4,-1,2,原创 2017-03-12 17:22:35 · 190 阅读 · 0 评论 -
第11周作业2(LeetCode16)
1. 题目描述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原创 2017-05-19 17:02:52 · 327 阅读 · 0 评论