1013. 将数组分成和相等的三个部分

╰+攻爆jí腚メ 2023-07-13 08:24 9阅读 0赞

# 题目： #

[1013. 将数组分成和相等的三个部分][1013.]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70]

# 题解： #

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70 1]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70 2]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70 3]  
![在这里插入图片描述][20200311130316101.png]

# 代码： #

/** * code1013 */
    public class code1013 { 
    
        public static boolean canThreePartsEqualSum(int[] A) { 
            if (A.length < 3) { 
                return false;
            }
            int sum = 0; // 数组总和
            for (int i = 0; i < A.length; i++) { 
                sum += A[i];
            }
            // 数组A的和不为0 并且 如果不能被3整除直接返回false
            if ((sum != 0) && (sum % 3 != 0)) { 
                return false;
            }
    
            int part_sum = 0; // 数组部分和，即数组总和的三分之一
            int count = 0; // 统计是否可以三等分
            // 遍历数组累加，每累加到目标值，count加1，表示又找到1段
            for (int i = 0; i < A.length; i++) { 
                part_sum += A[i];
                if (part_sum == sum / 3) { 
                    part_sum = 0;
                    count++;
                }
            }
            // 最后判断是否找到了3段（注意如果目标值是0的话可以大于3段）
            if (sum != 0 && count == 3) { 
                return true;
            } else if (sum == 0 && count >= 3) { 
                return true;
            }
            return false;
        }
    
        public static void main(String[] args) { 
            int A1[] = {  0, 2, 1, -6, 6, -7, 9, 1, 2, 0, 1 };
            boolean ans1 = canThreePartsEqualSum(A1);
            System.out.println(ans1);
    
            int A2[] = {  0, 2, 1, -6, 6, 7, 9, -1, 2, 0, 1 };
            boolean ans2 = canThreePartsEqualSum(A2);
            System.out.println(ans2);
    
            int A3[] = {  3, 3, 6, 5, -2, 2, 5, 1, -9, 4 };
            boolean ans3 = canThreePartsEqualSum(A3);
            System.out.println(ans3);
    
            int A4[] = {  10, -10, 10, -10, 10, -10, 10, -10 };
            boolean ans4 = canThreePartsEqualSum(A4);
            System.out.println(ans4);
        }
    }

# 参考： #

1.  [将数组分成和相等的三个部分][Link 1]
2.  [【将数组分成和相等的三个部分】：简洁的C++][C]
3.  [java 使用双指针][java]
4.  [c++ 一次遍历及优化（简洁易懂）-z][c_ _-z]

[1013.]: https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/20200311125733331.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ==,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70 1]: https://img-blog.csdnimg.cn/20200311130126895.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ==,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70 2]: https://img-blog.csdnimg.cn/20200311130211210.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ==,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70 3]: https://img-blog.csdnimg.cn/20200311130252220.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ==,size_16,color_FFFFFF,t_70
[20200311130316101.png]: https://img-blog.csdnimg.cn/20200311130316101.png
[Link 1]: https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/solution/1013-jiang-shu-zu-fen-cheng-he-xiang-deng-de-san-2/
[C]: https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/solution/jiang-shu-zu-fen-cheng-he-xiang-deng-de-san-ge-b-6/
[java]: https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/solution/java-shi-yong-shuang-zhi-zhen-by-sugar-31/
[c_ _-z]: https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/solution/c-xiang-jie-jian-ji-yi-dong-z-by-zrita/