Commit b046c8c

committed

Add Solution.java to problems 0034

1 parent e4f5e91 commit b046c8cCopy full SHA for b046c8c

File tree

+22

-0

lines changed

solution/0034.Find First and Last Position of Element in Sorted Array
- Solution.java
- Solution2.java

+22

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,6 +11,7 @@ public int[] searchRange(int[] nums, int target) {`
`11`	`11`	`}`
`12`	`12`	`return new int[]{-1,-1};`
`13`	`13`	`}`
	`14`	`+`
`14`	`15`	`private int findFirst(int[] nums, int start, int end, int target) {`
`15`	`16`	`while (start < end) {`
`16`	`17`	`int temp = start + (end - start) / 2;`
`@@ -19,6 +20,7 @@ private int findFirst(int[] nums, int start, int end, int target) {`
`19`	`20`	`}`
`20`	`21`	`return start;`
`21`	`22`	`}`
	`23`	`+`
`22`	`24`	`private int findEnd(int[] nums, int start, int end, int target) {`
`23`	`25`	`while (start < end) {`
`24`	`26`	`int temp = start + (end - start + 1) / 2;`

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,20 @@`
	`1`	`+class Solution {`
	`2`	`+ public int[] searchRange(int[] nums, int target) {`
	`3`	`+ int left = 0, right = nums.length - 1;`
	`4`	`+ while (left <= right) {`
	`5`	`+ int mid = left + (right - left) / 2;`
	`6`	`+ if (nums[mid] == target) {`
	`7`	`+ int resL = mid, resR = mid;`
	`8`	`+ while (resL > left && nums[resL - 1] == target) resL--;`
	`9`	`+ while (resR < right && nums[resR + 1] == target) resR++;`
	`10`	`+ return new int[]{resL, resR};`
	`11`	`+ }`
	`12`	`+ if (nums[mid] > target) {`
	`13`	`+ right = mid - 1;`
	`14`	`+ } else {`
	`15`	`+ left = mid + 1;`
	`16`	`+ }`
	`17`	`+ }`
	`18`	`+ return new int[]{-1, -1};`
	`19`	`+ }`
	`20`	`+}`

Comments

(0)