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

Commitd580a2b

Browse files
committed
Added 1 solution & modified 1 solution
1 parent32207f5 commitd580a2b

File tree

2 files changed

+71
-23
lines changed

2 files changed

+71
-23
lines changed

‎Easy/Reformat The String.java

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
classSolution {
2+
publicStringreformat(Strings) {
3+
List<Character>letters =newArrayList<>();
4+
List<Character>digits =newArrayList<>();
5+
for (charc :s.toCharArray()) {
6+
if (Character.isLetter(c)) {
7+
letters.add(c);
8+
}
9+
else {
10+
digits.add(c);
11+
}
12+
}
13+
if (Math.abs(letters.size() -digits.size()) >1) {
14+
return"";
15+
}
16+
returnletters.size() >digits.size() ?formPermutation(letters,digits) :formPermutation(digits,letters);
17+
}
18+
19+
privateStringformPermutation(List<Character>l1,List<Character>l2) {
20+
StringBuildersb =newStringBuilder();
21+
intidx1 =0;
22+
intidx2 =0;
23+
booleanisL1 =true;
24+
while (idx1 <l1.size() &&idx2 <l2.size()) {
25+
sb.append(isL1 ?l1.get(idx1++) :l2.get(idx2++));
26+
isL1 = !isL1;
27+
}
28+
if (idx1 <l1.size()) {
29+
sb.append(l1.get(idx1));
30+
}
31+
if (idx2 <l2.size()) {
32+
sb.append(l2.get(idx2));
33+
}
34+
returnsb.toString();
35+
}
36+
}

‎Medium/Find K Closest Elements.java

Lines changed: 35 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -1,29 +1,41 @@
11
classSolution {
2-
publicList<Integer>findClosestElements(int[]arr,intk,intx) {
3-
if (x <=arr[0]) {
4-
returnArrays.stream(arr).boxed().collect(Collectors.toList()).subList(0,k);
5-
}
6-
elseif (x >=arr[arr.length -1]) {
7-
returnArrays.stream(arr).boxed().collect(Collectors.toList()).subList(arr.length -k,arr.length);
2+
publicList<Integer>findClosestElements(int[]arr,intk,intx) {
3+
if (k ==0 ||arr.length ==0) {
4+
returnnewArrayList<>();
5+
}
6+
int[]diffArr =newint[arr.length];
7+
intminDiff =Integer.MAX_VALUE;
8+
intminDiffIdx = -1;
9+
for (inti =0;i <arr.length;i++) {
10+
diffArr[i] =Math.abs(arr[i] -x);
11+
if (minDiff >diffArr[i]) {
12+
minDiff =diffArr[i];
13+
minDiffIdx =i;
14+
}
15+
}
16+
intleft =minDiffIdx -1;
17+
intright =minDiffIdx +1;
18+
List<Integer>list =newArrayList<>();
19+
list.add(arr[minDiffIdx]);
20+
k--;
21+
while (k >0) {
22+
if (left >=0 &&right <arr.length) {
23+
if (diffArr[left] <=diffArr[right]) {
24+
list.add(arr[left--]);
825
}
926
else {
10-
intidx =Arrays.binarySearch(arr,x);
11-
if (idx <0) {
12-
idx = -idx -1;
13-
}
14-
intlow =Math.max(0,idx -k -1);
15-
inthigh =Math.min(arr.length -1,idx +k -1);
16-
17-
while (high -low >k -1) {
18-
if (low <0 || (x -arr[low]) <= (arr[high] -x)) {
19-
high--;
20-
}
21-
elseif ((high >arr.length -1 || (x -arr[low]) > (arr[high] -x))) {
22-
low++;
23-
}
24-
}
25-
26-
returnArrays.stream(arr).boxed().collect(Collectors.toList()).subList(low,high +1);
27+
list.add(arr[right++]);
2728
}
29+
}
30+
elseif (left >=0 &&right ==arr.length) {
31+
list.add(arr[left--]);
32+
}
33+
else {
34+
list.add(arr[right++]);
35+
}
36+
k--;
2837
}
38+
Collections.sort(list);
39+
returnlist;
40+
}
2941
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp