Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Написать метод проверки середины в массиве {2, 3, 7, 5, 1, 9, 0}
- int left = 0;
- int right = 0;
- for(int i = 0; i < arr.length - 1; i++) {
- left += arr[i];
- for(int j = i + 1; j < arr.length; j++)
- right += arr[j];
- }
- if(left == right) {
- System.out.println("Середина есть");
- return true;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement