Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit1ab014e

Browse files
refactor 1287
1 parent665c0a1 commit1ab014e

File tree

1 file changed

+0
-15
lines changed

1 file changed

+0
-15
lines changed

‎src/main/java/com/fishercoder/solutions/_1287.java

Lines changed: 0 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,20 +1,5 @@
11
packagecom.fishercoder.solutions;
22

3-
/**
4-
* 1287. Element Appearing More Than 25% In Sorted Array
5-
*
6-
* Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time.
7-
* Return that integer.
8-
*
9-
* Example 1:
10-
* Input: arr = [1,2,2,6,6,6,6,7,10]
11-
* Output: 6
12-
*
13-
* Constraints:
14-
*
15-
* 1 <= arr.length <= 10^4
16-
* 0 <= arr[i] <= 10^5
17-
* */
183
publicclass_1287 {
194
publicstaticclassSolution1 {
205
publicintfindSpecialInteger(int[]arr) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp