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

Appearance settings

Latest commit

 

History

History
History
33 lines (30 loc) · 839 Bytes

File metadata and controls

33 lines (30 loc) · 839 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package leetcode.sildeWindow;
public class leetcode523 {
public boolean checkSubarraySum(int[] nums, int k) {
int sum=0;
for (int i = 0; i <nums.length; i++) {
sum+=nums[i];
}
if (k==0&&sum==0){
return true;
}else if (k==0&&sum!=0){
return false;
}
int left=0;
int right=nums.length-1;
while(left<right){
//left+1、right-1分别尝试下
if (sum%k==0||(sum-nums[left])%6==0||(sum-nums[right])%6==0)
return true;
sum=sum-nums[left]-nums[right];
left++;
right--;
}
return false;
}
public static void main(String[] args) {
new leetcode523().checkSubarraySum(new int[]{
23,2,4,6,7
},6);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.