-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFinal.java
More file actions
68 lines (61 loc) · 1.74 KB
/
Copy pathFinal.java
File metadata and controls
68 lines (61 loc) · 1.74 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
65
66
67
68
package com.example.Final;
public class Final {
public void indexWeightedSum(double n[]){
double sum = 0;
for (int i = 0; i <= n.length - 1; i++){
sum += n[i] * i;
}
System.out.println(sum);
}
public void charsToString(char n[]){
String a = "";
for (int i = 0; i <= n.length - 1; i++){
if (n[i] >= 97 && n[i] <= 122){
a += n[i];
}
}
System.out.println(a);
}
public void ifSum(int n[], int m){
boolean a = false;
for (int i = 0; i <= n.length - 2; i++){
if (n[i] + n[i + 1] == m){
a = true;
}
}
if (a == true){
System.out.println("yes");
}
else{
System.out.println("no");
}
}
public void mostChar(char n[]){
int alpha[] = new int[26];
int max;
int pos = 0;
for (int i = 0; i <= n.length - 1; i++){
alpha[n[i] - 97]++;
}
max = alpha[0];
for (int i = 0; i <= alpha.length - 1; i++){
if (alpha[i] > max){
max = alpha[i];
pos = i;
}
}
System.out.println((char)(pos + 97));
}
public static void main(String[]args){
Final runner = new Final();
double a[] = {5.8, 3.1, 2.5};
char b[] = {'h', 'i', '!', 'H', 'e', 'l', 'L', 'o', '?'};
int c[] = {1,5,2,7,3};
char d[] = {'h', 'k', 'h', 'u', 'b', 'e', 'k', 'u', 'u'};
int e = 9;
runner.indexWeightedSum(a);
runner.charsToString(b);
runner.ifSum(c, e);
runner.mostChar(d);
}
}