From 3cc1cd50c2b83d95f11a1c264c915a81226bc878 Mon Sep 17 00:00:00 2001
From: lucky4 <591398706@qq.com>
Date: Sat, 23 Dec 2017 08:19:04 +0800
Subject: [PATCH] fix snippets/arrayLcm part syntax

---
 README.md            | 2 +-
 snippets/arrayLcm.md | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 58528c68e..a64842de8 100644
--- a/README.md
+++ b/README.md
@@ -290,7 +290,7 @@ Use `Array.reduce()` and the `lcm` formula (uses recursion) to calculate the low
 ```js
 const arrayLcm = arr =>{
   const gcd = (x, y) => !y ? x : gcd(y, x % y);
-  const lcm = (x, y) => (x*y)/gcd(x, y); 
+  const lcm = (x, y) => (x*y)/gcd(x, y) 
   return arr.reduce((a,b) => lcm(a,b));
 }
 // arrayLcm([1,2,3,4,5]) -> 60
diff --git a/snippets/arrayLcm.md b/snippets/arrayLcm.md
index 3b0ad354c..8d4e593fb 100644
--- a/snippets/arrayLcm.md
+++ b/snippets/arrayLcm.md
@@ -7,7 +7,7 @@ Use `Array.reduce()` and the `lcm` formula (uses recursion) to calculate the low
 ```js
 const arrayLcm = arr =>{
   const gcd = (x, y) => !y ? x : gcd(y, x % y);
-  const lcm = (x, y) => (x*y)/gcd(x, y) 
+  const lcm = (x, y) => (x*y)/gcd(x, y); 
   return arr.reduce((a,b) => lcm(a,b));
 }
 // arrayLcm([1,2,3,4,5]) -> 60