forked from ArinaJur/CodingPracticeLessons
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAscendingSequence.java
More file actions
49 lines (37 loc) · 1.35 KB
/
AscendingSequence.java
File metadata and controls
49 lines (37 loc) · 1.35 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
import java.util.ArrayList;
import java.util.List;
public class AscendingSequence {
public int[] buildAscendingArray (int startNumber, int endNumber) {
int[] array = new int[endNumber - startNumber + 1];
for (int i = 0; i < endNumber - startNumber + 1; i ++) {
array[i] = startNumber + i;
System.out.print(array[i]);
}
return array;
}
//конкатенация строк "а" + "б"
//String.format()
//String.concat()
//StringBuilder
public String buildAscendingString(int startNumber, int endNumber) {
StringBuilder stringBuilder = new StringBuilder();
if (startNumber < endNumber && startNumber >= Integer.MIN_VALUE && endNumber <= Integer.MAX_VALUE) {
for (int i = startNumber; i < endNumber; i ++) {
stringBuilder.append(i).append(", ");
}
stringBuilder.append(endNumber);
System.out.println(stringBuilder);
return String.valueOf(stringBuilder);
} else {
return "Error";
}
}
//1, 2, 3, 4, 5
public List<Integer> buildAscendingList(int startNumber, int endNumber, int step) {
List<Integer> list = new ArrayList<>();
for(int i = startNumber; i <= endNumber; i += step) {
list.add(i);
}
return list;
}
}