Create Readme.md

wisdompeak · web-flow · commit 99bc3f5d7e2b · 2021-08-29T14:52:52.000-07:00
diff --git a/Hash/1983.Widest-Pair-of-Indices-With-Equal-Range-Sum/Readme.md b/Hash/1983.Widest-Pair-of-Indices-With-Equal-Range-Sum/Readme.md
@@ -0,0 +1,14 @@
+### 1983.Widest-Pair-of-Indices-With-Equal-Range-Sum
+
+&#20196;pre1&#34920;&#31034;nums1&#30340;&#21069;&#32512;&#21644;&#25968;&#32452;&#65292;pre2&#34920;&#31034;nums2&#30340;&#21069;&#32512;&#21644;&#25968;&#32452;&#12290;&#26412;&#39064;&#21363;&#27714;&#36328;&#24230;&#26368;&#22823;&#30340;{i,j}&#20351;&#24471;
+```
+pre1[j]-pre1[i] = pre2[j]-pre2[i]
+```
+&#31245;&#24494;&#31227;&#39033;&#21464;&#25442;
+```
+pre1[j]-pre2[j] = pre1[i]-pre2[i]
+```
+&#20196;diff&#25968;&#32452;&#34920;&#31034;pre1-pre2&#20043;&#24046;&#65292;&#37027;&#20040;&#24613;&#27714;&#36328;&#24230;&#26368;&#22823;&#30340;{i,j}&#20351;&#24471;
+```
+dfff[i] = diff[j]
+```

-Original file line number
+Diff line change
@@ @@ -0,0 +1,14 @@ @@
 +### 1983.Widest-Pair-of-Indices-With-Equal-Range-Sum
++
 +令pre1表示nums1的前缀和数组，pre2表示nums2的前缀和数组。本题即求跨度最大的{i,j}使得
 +```
 +pre1[j]-pre1[i] = pre2[j]-pre2[i]
 +```
 +稍微移项变换
 +```
 +pre1[j]-pre2[j] = pre1[i]-pre2[i]
 +```
 +令diff数组表示pre1-pre2之差，那么急求跨度最大的{i,j}使得
 +```
 +dfff[i] = diff[j]
 +```