diff --git a/problems/0416.分割等和子集.md b/problems/0416.分割等和子集.md
index 03eae8ef..fa677da0 100644
--- a/problems/0416.分割等和子集.md
+++ b/problems/0416.分割等和子集.md
@@ -152,6 +152,8 @@ public:
         for (int i = 0; i < nums.size(); i++) {
             sum += nums[i];
         }
+        // 也可以使用库函数一步求和
+        // int sum = accumulate(nums.begin(), nums.end(), 0);
         if (sum % 2 == 1) return false;
         int target = sum / 2;