From d695b170a109b9cf4ed960e8971210d4cf92ee6a Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Fri, 30 Oct 2026 20:18:08 +0800
Subject: [PATCH] =?UTF-8?q?Update=2066.=20=E6=9E=84=E5=BB=BA=E4=B9=98?=
 =?UTF-8?q?=E7=A7=AF=E6=95=B0=E7=BB=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

补充解题思路小节中关于左右乘积拆分与双向遍历计算方法的文字说明。
---
 notes/66. 构建乘积数组.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/notes/66. 构建乘积数组.md b/notes/66. 构建乘积数组.md
index 3564ac42..188fcdd4 100644
--- a/notes/66. 构建乘积数组.md	
+++ b/notes/66. 构建乘积数组.md	
@@ -10,9 +10,10 @@
 
 <div align="center"> <img src="pics/offer-product-array.png" width="560px"/> </div><br>
 
-
 ## 解题思路
 
+B[i] 等于 A[i] 左边所有元素的乘积乘以右边所有元素的乘积。第一遍从左往右，让 B[i] 等于左边的乘积；第二遍从右往左，用 product 累乘右边的元素，再乘到 B[i] 上。两遍都是 O(N)，不需要除法。
+
 ```java
 public int[] statisticalResult(int[] arrayA) {
     int n = arrayA.length;