Commit8a0a6ae

authored

Merge pull requestneetcode-gh#1101 from agnihotriketan/patch-31

Create 34-Find-First-and-Last--Position-of-Element-in-Sorted-Array.cs

2 parents2093781 +ebe0356 commit8a0a6aeCopy full SHA for 8a0a6ae

File tree

+51

-0

lines changed

+51

-0

lines changed

Lines changed: 51 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,51 @@`
	`1`	`+publicclassSolution{`
	`2`	`+publicint[]SearchRange(int[]nums,inttarget)`
	`3`	`+{`
	`4`	`+intfirst=-1,last=-1;`
	`5`	`+`
	`6`	`+first=searchEle(nums,target,true);`
	`7`	`+if(first==-1)`
	`8`	`+returnnewint[]{first,last};`
	`9`	`+`
	`10`	`+last=searchEle(nums,target,false);`
	`11`	`+`
	`12`	`+`
	`13`	`+returnnewint[]{first,last};`
	`14`	`+}`
	`15`	`+`
	`16`	`+publicintsearchEle(int[]nums,inttarget,boolisStart)`
	`17`	`+{`
	`18`	`+intn=nums.Length;`
	`19`	`+intstart=0,end=nums.Length-1;`
	`20`	`+`
	`21`	`+while(start<=end)`
	`22`	`+{`
	`23`	`+intmid=(start+end)/2;`
	`24`	`+if(nums[mid]==target)`
	`25`	`+{`
	`26`	`+if(isStart)`
	`27`	`+{`
	`28`	`+if(mid==start\|\|nums[mid-1]!=target)`
	`29`	`+{`
	`30`	`+returnmid;`
	`31`	`+}`
	`32`	`+end=mid-1;`
	`33`	`+}`
	`34`	`+else`
	`35`	`+{`
	`36`	`+if(mid==end\|\|nums[mid+1]!=target)`
	`37`	`+{`
	`38`	`+returnmid;`
	`39`	`+}`
	`40`	`+start=mid+1;`
	`41`	`+}`
	`42`	`+}`
	`43`	`+elseif(nums[mid]>target)`
	`44`	`+end=mid-1;`
	`45`	`+else`
	`46`	`+start=mid+1;`
	`47`	`+`
	`48`	`+}`
	`49`	`+return-1;`
	`50`	`+}`
	`51`	`+}`

Comments

(0)