forked from rajatgoyal715/Hackerrank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRichieRich.java
More file actions
64 lines (62 loc) · 1.61 KB
/
RichieRich.java
File metadata and controls
64 lines (62 loc) · 1.61 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package Strings;
import java.util.Scanner;
public class RichieRich {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
char c[] = in.next().toCharArray();
boolean flag=true;
boolean v[]=new boolean[n];
label:
for(int i=0;i<=n/2;i++){
if(c[i]>c[n-1-i]){
if(k>0){
k--;
c[n-1-i]=c[i];
v[n-1-i]=true;
}
else{
flag=false;
break label;
}
}
else if(c[i]<c[n-1-i]){
if(k>0){
k--;
c[i]=c[n-1-i];
v[i]=true;
}
else{
flag=false;
break label;
}
}
}
if(!flag){
System.out.println("-1");
}
else{
for(int i=0;i<=n/2;i++){
if(c[i]!='9'&&c[n-1-i]!='9'){
if(k>0&&(v[i]||v[n-1-i])){
k--;
c[i]='9';
c[n-1-i]='9';
}
else if(k>0&&i==n/2){
k--;
c[i]='9';
c[n-1-i]='9';
}
else if(k>1){
k-=2;
c[i]='9';
c[n-1-i]='9';
}
}
}
System.out.println(c);
}
}
}