全部 文章 问答 分享 共找到8个相关内容
[文章] Leetcode刷题记录(一)
原题链接:https://leetcode.cn/problems/zigzag-conversion/1.题目描述将一个给定字符串s根据给定的行数numRows,以从上往下、从左到右进行 Z字形排列。
2022-08-01 16:36 · 算法 / kotlin
[文章] LeetCode 每日一题
LeetCode每日一题二分专题2020/10/07Sqrt(x)Easy15392037AddtoListShareImplementintsqrt(intx).Computeandreturnthesquarerootofx
2020-11-10 17:41 · LeetCode / 算法 / 面试
[问答] leetcode面试题 17.16. 按摩师 代码提交执行超时
https://leetcode-cn.com/problems/the-masseuse-lcci/阅读前两个提示之后尝试递归解决测试用例:[104,209,137,52,158,67,213,86,141,110,151,127,238,147,169,138,240,185,246,225,147,203,83,83,131,227,54,78,165,180,214,151,111,161,233,147,124,143
2020-03-24 13:13 · JavaScript
[文章] 动态规划 -- 简单入门
来源:力扣(LeetCode)链接:https://leetcode.cn/problems/fibonacci-number著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2022-08-05 11:21 · 算法
[文章] LeetCode 每日一题
Searcha2DMatrixMedium2226167AddtoListShareWriteanefficientalgorithmthatsearchesforavalueinanmxnmatrix.Thismatrixhasthefollowingproperties:Integersineachrowaresortedfromlefttoright.Thefirstintegerofeachrowisgreaterthanthelastintegerofthepreviousrow.Example1:Input:matrix=[[1,3,5,7],[10,11,16,20],[23,30,34,50]],target=3Output:trueExample2:Input:matrix=[[1,3,5,7],[10,11,16,20],[23,30,34,50]],target=13Output:falseExample3:Input:matrix=[],target=0Output:falseConstraints:m==matrix.lengthn==matrix[i].length0<=m,n<=100-104<=matrix[i][j],target<=104主要代码classSolution{publicbooleansearchMatrix(int[][]matrix,inttarget){introw=matrix.length;if(row==0){returnfalse;}intcol=matrix[0].length;intlen=row*col+5;int[]tmp=newint[len];intk=0;for(inti=0;i<row;i++){for(intj=0;j<col;j++){tmp[k++]=matrix[i][j];}}intl=0,r=k-1;while(l<r){intmid=(l+r)/2;if(tmp[mid]==target){returntrue;}elseif(tmp[mid]>target){r=mid-1;}else{l=mid+1;}}if(tmp[l]==target){returntrue;}returnfalse;}}
2020-11-15 20:39 · 算法 / LeetCode / 二分专题
[文章] LeetCode每日一题
SearchinRotatedSortedArrayMedium5959518AddtoListShareYouaregivenanintegerarraynumssortedinascendingorder,andanintegertarget.Supposethatnumsisrotatedatsomepivotunknowntoyoubeforehand(i.e.,[0,1,2,4,5,6,7]mightbecome[4,5,6,7,0,1,2]).Iftargetisfoundinthearrayreturnitsindex,otherwise,return-1.Example1:Input:nums=[4,5,6,7,0,1,2],target=0Output:4Example2:Input:nums=[4,5,6,7,0,1,2],target=3Output:-1Example3:Input:nums=[1],target=0Output:-1Constraints:1<=nums.length<=5000-10^4<=nums[i]<=10^4Allvaluesofnumsareunique.numsisguranteedtoberotatedatsomepivot.-10^4<=target<=10^4主要代码classSolution{publicintsearch(int[]nums,inttarget){if(nums.length==1){if(nums[0]==target){return0;}else{return-1;}}//1.找到分割点intlen=nums.length;inttmp=0;for(inti=1;i<len;i++){if(nums[i]<nums[i-1]){tmp=i;}}intl=0,r=tmp-1;while(l<r){intmid=(l+r)/2;if(nums[mid]==target){returnmid;}elseif(nums[mid]>target){r=mid-1;}else{l=mid+1;}}if(nums[l]==target){returnl;}l=tmp;r=len-1;while(l<r){intmid=(l+r)/2;if(nums[mid]==target){returnmid;}elseif(nums[mid]>target){r=mid-1;}else{l=mid+1;}}if(nums[l]==target){returnl;}return-1;}}
2020-11-14 11:12 · LeetCode / 二分 / 算法
[文章] LeetCode每日一题 (二分专题)
SearchInsertPositionEasy2743266AddtoListShareGivenasortedarrayofdistinctintegersandatargetvalue,returntheindexifthetargetisfound.Ifnot,returntheindexwhereitwouldbeifitwereinsertedinorder.Example1:Input:nums=[1,3,5,6],target=5Output:2Example2:Input:nums=[1,3,5,6],target=2Output:1Example3:Input:nums=[1,3,5,6],target=7Output:4Example4:Input:nums=[1,3,5,6],target=0Output:0Example5:Input:nums=[1],target=0Output:0Constraints:1<=nums.length<=104-104<=nums[i]<=104numscontainsdistinctvaluessortedinascendingorder.-104<=target<=104解决思路利用Java自带的库函数a.利用contains判断数组是否包含数字b.如果包含,则返回索引c.不包含,则循环遍历利用Java自带的Stream进行遍历二分搜索部分代码classSolution{publicintsearchInsert(int[]nums,inttarget){intl=0,r=nums.length-1;if(nums[r]<target){returnnums.length;}while(l<r){intmid=(l+r)/2;if(nums[mid]>=target){r=mid;}else{l=mid+1;}}returnl;}}全部代码packageEasy.sangshiwu;importjava.io.BufferedReader;importjava.io.IOException;importjava.io.InputStreamReader;importjava.util.Arrays;classSolution{publicintsearchInsert(int[]nums,inttarget){intl=0,r=nums.length-1;//if(nums[r]<target){//returnnums.length;//}if(nums[l]>=target){return0;}while(l<r){intmid=(l+r)/2;if(nums[mid]>=target){r=mid;}else{l=mid+1;}}returnl;//returnArrays.stream(nums)//.forEach();//if(Arrays.stream(nums))}privatebooleanchecked(intvalue,inttarget){returnfalse;}}publicclassMainClass{publicstaticvoidmain(String[]args)throwsIOException{intres=newSolution().searchInsert(newint[]{1,3,5,6},5);System.out.println(res);//BufferedReaderin=newBufferedReader(newInputStreamReader(System.in));//Stringline;//while((line=in.readLine())!=null){//int[]nums=line.to//intret=newSolution().searchInsertan);//Stringout=String.valueOf(ret);//System.out.print(out);//}}}
2020-11-12 16:07 · LeetCode / 算法 / 二分
[文章] 面试题:一个有名的按摩师会收到源源不断的预约请求
注意:本题相对原题稍作改动来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/the-masseuse-lcci著作权归领扣网络所有。
2020-04-25 10:54 · 算法 / java / 面试题 / javascript
  • 1