-
Notifications
You must be signed in to change notification settings - Fork 0
/
Gama.java
145 lines (123 loc) · 3.56 KB
/
Gama.java
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
/**
* Gama
*/
import java.util.*;;
class Alpha {
int i;
int j;
Alpha() {
i = 20;
j = 22;
}
}
class Beta extends Alpha {
Beta() {
super();
i = 18;
}
}
public class Gama {
public static void main(String[] args) {
Beta obj = new Beta();
Gama obj1 = new Gama();
Alpha obj2 = new Alpha();
// System.out.println(Gama.findMinimumCharacters("armaze", "amazon"));
ArrayList<String> list = new ArrayList<String>();
list.add("011");
list.add("101");
list.add("110");
System.out.println(Gama.getMaximumGreyness(list));
}
public static void str(String s) {
int mlen = 1;
int beg = 0;
int len = s.length();
int low, high;
for (int i = 0; i < len; i++) {
low = i - 1;
high = i;
while (low >= 0 && high < len && s.charAt(low) == s.charAt(high)) {
--low;
++high;
}
++low;
--high;
if (s.charAt(low) == s.charAt(high) && high - low + 1 > mlen) {
beg = low;
mlen = high - low + 1;
}
low = i - 1;
high = i + 1;
while (low >= 0 && high < len && s.charAt(low) == s.charAt(high)) {
--low;
++high;
}
++low;
--high;
if (s.charAt(low) == s.charAt(high) && high - low + 1 > mlen) {
beg = low;
mlen = high - low + 1;
}
}
int ans = mlen;
while (ans > 0)
;
System.out.println(s.charAt(beg++));
}
public static int findMinimumCharacters(String searchWord, String resultWord) {
int searchWord_cnt = 0;
int resultWord_cnt = 0;
while (searchWord_cnt < searchWord.length()) {
if (searchWord.charAt(searchWord_cnt) == resultWord.charAt(resultWord_cnt)) {
resultWord_cnt += 1;
if (resultWord_cnt == resultWord.length()) {
return 0;
}
}
searchWord_cnt += 1;
}
return (resultWord.length() - resultWord_cnt);
}
public static int getMaximumGreyness(ArrayList<String>pixels){
int arr[][]=new int[pixels.size()][pixels.get(0).length()];
for(int i=0;i<pixels.size();i++){
for(int j=0;j<pixels.get(0).length();j++){
arr[i][j]=pixels.get(i).charAt(j)-'0';
}
}
int row1[]=new int[pixels.get(0).length()];
for(int i=0;i<pixels.size();i++){
int sum=0;
for(int j=0;j<pixels.get(0).length();j++){
sum+=arr[i][j];
}
row1[i]=sum;
}
int col1[]=new int[pixels.size()];
for(int i=0;i<pixels.size();i++){
int sum=0;
for(int j=0;j<pixels.get(0).length();j++){
sum+=arr[j][i];
}
col1[i]=sum;
}
int m=arr.length;
int n=arr[0].length;
int max=Integer.MIN_VALUE;
int anx[][]=new int[m][n];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
anx[i][j]=0;
}
}
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
int x=row1[i];
int y=col1[j];
anx[i][j]=2*(x+y)-(m+n);
max=Math.max(max,anx[i][j]);
}
}
return max;
}
}