-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
944.java
58 lines (54 loc) · 1.46 KB
/
944.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
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public int minDeletionSize(String[] A) {
if (A == null) {
return 0;
}
int count =0 ;
int len = A[0].length();
for (int i = 0; i < len; i++) {
if(isNoSort(A, i)) count++;
}
return count;
}
public static boolean isNoSort(String[] A, int num) {
char c = A[0].charAt(num);
for(int i =0;i<A.length;i++) {
if (A[i].charAt(num) < c) return true;
c = A[i].charAt(num);
}
return false;
}
}
__________________________________________________________________________________________________
sample 38432 kb submission
class Solution {
public int minDeletionSize(String[] A) {
int res = 0;
// M: total words ( rows )
// N: word length ( cols )
int M = A.length, N = A[0].length();
for(int i = 0; i < N; i++){
char[] seq = new char[M];
for(int j = 0; j < M; j++){
seq[j] = A[j].charAt(i);
}
if(!sorted(seq)){
res++;
}
}
return res;
}
private boolean sorted(char[] ch){
char curr = ch[0];
for(char c :ch){
if(c < curr){
return false;
}
curr = c;
}
return true;
}
}
__________________________________________________________________________________________________