Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit9076ca2

Browse files
arithmetic slices
1 parent9111de9 commit9076ca2

File tree

2 files changed

+41
-0
lines changed

2 files changed

+41
-0
lines changed
Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
packagemedium;
2+
3+
publicclassArithmeticSlices {
4+
5+
//copied this solution: https://discuss.leetcode.com/topic/62884/2ms-java-o-n-time-o-1-space-solution
6+
publicintnumberOfArithmeticSlices(int[]A) {
7+
intsum =0,len =2;
8+
for (inti =2;i <A.length;i++){
9+
if (A[i] -A[i-1] ==A[i-1] -A[i-2]){
10+
len++;
11+
}else {
12+
if (len >2)sum +=calculateSlices(len);
13+
len =2;//reset it to 2
14+
}
15+
}
16+
if(len >2)sum +=calculateSlices(len);
17+
returnsum;
18+
}
19+
20+
intcalculateSlices(intlen){
21+
return (len-1)*(len-2)/2;
22+
}
23+
24+
classSolution2{
25+
//a more clear solution: https://discuss.leetcode.com/topic/63302/simple-java-solution-9-lines-2ms
26+
publicintnumberOfArithmeticSlices(int[]A) {
27+
intsum =0,curr =0;
28+
for (inti =2;i <A.length;i++){
29+
if (A[i] -A[i-1] ==A[i-1] -A[i-2]){
30+
curr++;
31+
sum +=curr;
32+
}else {
33+
curr =0;
34+
}
35+
}
36+
returnsum;
37+
}
38+
}
39+
40+
}

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@
66
|419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)|[Solution](../../blob/master/MEDIUM/src/medium/BattleshipsinaBoard.java) | O(n^2) |O(1) | Medium| DFS
77
|417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../../blob/master/MEDIUM/src/medium/PacificAtlanticWaterFlow.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS
88
|415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../../blob/master/EASY/src/easy/AddStrings.java)| O(n)|O(1)| Easy|
9+
|413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)|[Solution](../../blob/master/MEDIUM/src/medium/ArithmeticSlices.java) | O(n) |O(1) | Medium| DP
910
|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)|[Solution](../../blob/master/EASY/src/easy/FizzBuzz.java)| O(n)|O(1)| Easy|
1011
|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[Solution](../../blob/master/EASY/src/easy/SumofLeftLeaves.java)| O(n)|O(h)| Easy|
1112
|398|[Random Pick Index](https://leetcode.com/problems/random-pick-index/)|[Solution](../../blob/master/MEDIUM/src/medium/RandomPickIndex.java) | | | Medium| Reservoir Sampling

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp