chefyuan

chefyuan · chefyuan · commit 475db0e12398 · 2021-04-07T20:01:23.000+08:00
diff --git a/animation-simulation/链表篇/面试题 02.05. 链表求和.md b/animation-simulation/链表篇/面试题 02.05. 链表求和.md
@@ -86,7 +86,7 @@ class Solution {
              int sum = l1num+l2num+summod;
              //更新进位值，例18/10=1，9/10=0
              summod = sum/10;
-             //新节点保存的值，18%8=8，则添加8
+             //新节点保存的值，18 % 8=2，则添加2
              sum = sum%10; 
              //添加节点
              tempnode.next = new ListNode(sum);
