Skip to content

Commit 17f0d4d

Browse files
solves sum of all odd length sub arrays
1 parent fcd2d1f commit 17f0d4d

File tree

2 files changed

+11
-1
lines changed

2 files changed

+11
-1
lines changed

README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -395,4 +395,5 @@
395395
| 1566 | [Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times) | [![Java](assets/java.png)](src/DetectPatternOfLengthMRepeatedKOrMoreTimes.java) | |
396396
| 1572 | [Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum) | [![Java](assets/java.png)](src/MatrixDiagonalSum.java) | |
397397
| 1576 | [Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters) | [![Java](assets/java.png)](src/ReplaceAllToAvoidConsecutiveRepeatingCharacters.java) | |
398-
| 1582 | [Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix) | [![Java](assets/java.png)](src/SpecialPositionInABinaryMatrix.java) | |
398+
| 1582 | [Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix) | [![Java](assets/java.png)](src/SpecialPositionInABinaryMatrix.java) | |
399+
| 1588 | [Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays) | [![Java](assets/java.png)](src/SumOfAllOddLengthSubArrays.java) | |

src/SumOfAllOddLengthSubArrays.java

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
public class SumOfAllOddLengthSubArrays {
2+
public int sumOddLengthSubarrays(int[] array) {
3+
int sum = 0;
4+
for (int index = 0 ; index < array.length ; index++) {
5+
sum += (((array.length - index) * (index + 1) + 1) / 2) * array[index];
6+
}
7+
return sum;
8+
}
9+
}

0 commit comments

Comments
 (0)