Skip to content

Commit 50582d1

Browse files
committed
feat: spotless fix
1 parent 6a706ad commit 50582d1

File tree

1 file changed

+13
-14
lines changed
  • lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11

1 file changed

+13
-14
lines changed

lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java

Lines changed: 13 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -4,39 +4,38 @@
44
import java.util.List;
55

66
public class Lesson11 {
7-
87
public int[] getConcatenation(int[] nums) {
9-
if(nums.length == 0){
10-
return new int[]{};
8+
if (nums.length == 0) {
9+
return new int[] {};
1110
}
1211
int lenOriginalArray = nums.length;
1312
int[] concatenatedArrays = new int[lenOriginalArray * 2];
14-
15-
for(int i= 0; i < lenOriginalArray; i++){
13+
14+
for (int i = 0; i < lenOriginalArray; i++) {
1615
concatenatedArrays[i] = nums[i];
1716
}
1817
int nextIndex = lenOriginalArray;
19-
for(int i= 0; i < lenOriginalArray; i++){
20-
concatenatedArrays[nextIndex+i] = nums[i];
18+
for (int i = 0; i < lenOriginalArray; i++) {
19+
concatenatedArrays[nextIndex + i] = nums[i];
2120
}
2221
return concatenatedArrays;
2322
}
2423

2524
public List<Integer> findWordsContaining(String[] words, char x) {
2625
var indexList = new ArrayList<Integer>();
27-
if(words.length == 0){
26+
if (words.length == 0) {
2827
return indexList;
29-
}
30-
28+
}
29+
3130
int index = -1;
32-
for(String word : words){
31+
for (String word : words) {
3332
index = index + 1;
3433
var charactersOfWord = new ArrayList<Character>();
3534
char charactersOfCurrentWord[] = word.toCharArray();
36-
for(Character xter : charactersOfCurrentWord){
37-
charactersOfWord.add(xter);
35+
for (Character xter : charactersOfCurrentWord) {
36+
charactersOfWord.add(xter);
3837
}
39-
if (charactersOfWord.contains(x)){
38+
if (charactersOfWord.contains(x)) {
4039
indexList.add(index);
4140
}
4241
}

0 commit comments

Comments
 (0)