xiaomengxian1998的博客

题目链接：https://leetcode.com/problems/implement-strstr/Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.思路：按照简单的做可

ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { int carry=0,sum,x,y; ListNode q(0),*tmp1=l1,*tmp2=l2,*re=&q; while(tmp1||tmp2) { x=tm

题目描述：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

首先分析一下时间最短的解法int lengthOfLongestSubstring(string s){ vector vec(256,-1); int i,start=-1,maxLength=0; for(i=0;i<s.size();i++) { if(vec[s[i]]>start) start=vec

这是我第一次刷leetcode做的最顺利的一道题了吧，但是还不是一次性提交的，下面是我的代码：double findMedianSortedArrays(vector& nums1, vector& nums2) { int l1=nums1.size(),l2=nums2.size(),sz=nums1.size()+nums2.size(),i=0,j=0;

看完题目就蒙圈了，所以就直接看了别人的答案几个答案看下来，基本上有这么三种思路1.最清晰易懂的一种string convert(string s,int numRows){ if(s.size() return s; int len=s.size(),j,row=0,step=1; string *str=new string[numRows]; f