【HackerRank】Sherlock and Array

Watson gives an array A₁,A₂...A_N to Sherlock. Then he asks him to find if there exists an element in the array, such that, the sum of elements on its left is equal to the sum of elements on its right. If there are no elements to left/right, then sum is considered to be zero.
Formally, find an i, such that, A₁+A₂...A_i-1 = A_i+1+A_i+2...A_N.

Input Format
The first line contains T, the number of test cases. For each test case, the first line contains N, the number of elements in the array A. The second line for each testcase contains N space separated integers, denoting the array A.

Output Format
For each test case, print YES if there exists an element in the array, such that, the sum of elements on its left is equal to the sum of elements on its right, else print NO.

Constraints
1 ≤ T ≤ 10
1 ≤ N ≤ 10⁵
1 ≤ A_i ≤ 2*10⁴ for 1 ≤ i ≤ N

---

先求出数组总的sum，然后遍历一遍数组，遍历的过程中分别累加（减）求出一个元素的左边元素之和left（left的累加在这个元素上一个元素的循环中完成，见代码第30行）和右边元素之和right，然后比较是否相等即可，时间复杂度O(n)，代码如下：

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        while(t-- > 0){
            int n = in.nextInt();
            int[] num = new int[n];
            int sum = 0;
            
            for(int i = 0;i < n;i++){
                num[i] = in.nextInt();
                sum += num[i];
            }
            int left = 0;
            int right = sum;
            boolean find = false;
            for(int i = 0;i < n;i++){
                right -= num[i];
                if(left == right)
                {
                    find = true;
                    break;
                }
                left += num[i];
            }
            if(find)
                System.out.println("YES");
            else
                System.out.println("NO");
        }
      }
}