-
Notifications
You must be signed in to change notification settings - Fork 1
/
Remove1Digit for Palindrome.txt
67 lines (60 loc) · 1.4 KB
/
Remove1Digit for Palindrome.txt
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
65
66
67
int num = input1;
boolean palindrome = false;
int digit;
ArrayList<Integer> rev = new ArrayList<Integer>();
ArrayList<Integer> org = new ArrayList<Integer>();
ArrayList<Integer> orgCpy = new ArrayList<Integer>();
ArrayList<Integer> revCpy = new ArrayList<Integer>();
int r;
while(num>0){
r = num%10;
rev.add(r);
revCpy.add(r);
num/=10;
}
for(int i=rev.size()-1; i>=0; i--){
org.add(rev.get(i));
orgCpy.add(rev.get(i));
}
int k= org.size()-1;
//Algorithm: try by removing 1 number at a time and check palindrome if not
//first check already existing palindrome
for(int i=0; i<org.size(); i++){
if(org.get(i)==rev.get(i)){
palindrome = true;
}
else{
palindrome = false;
break;
}
}
if(palindrome)
return -1;
else if(!palindrome){
while(k>=0){
digit = org.get(k);
org.remove(k);
rev.remove(rev.size()-k-1);
for(int j=0; j<org.size(); j++){
if(org.get(j)==rev.get(j)){
palindrome = true;
}
else{
palindrome = false;
org.clear();
rev.clear();
Collections.copy(org,orgCpy);
Collections.copy(rev,revCpy);
break;
}
}
if(palindrome)
return digit;
k--;
}
//for(int i=org.size()-1; i>=0; i--){
//remove ith element then check for palindrome
//}
}
return 0;
}