Update README.md

Author: assassint2017

README.md

@@ -4,7 +4,7 @@
 # leetcode-algorithm
 |total|easy|medium|hard|
 |:---:|:---:|:---:|:---:|
-|260|94|130|36|
+|261|95|130|36|
 ----
 1. [Two Sum](https://github.com/assassint2017/leetcode-algorithm/tree/master/Two%20Sum)
 2. [Add Two Numbers](https://github.com/assassint2017/leetcode-algorithm/tree/master/Add%20Two%20Numbers)
@@ -259,6 +259,7 @@
 596. [Classes More Than 5 Students](https://github.com/assassint2017/leetcode-algorithm/tree/master/Classes%20More%20Than%205%20Students)
 620. [Not Boring Movies](https://github.com/assassint2017/leetcode-algorithm/tree/master/Not%20Boring%20Movies)
 627. [Swap Salary](https://github.com/assassint2017/leetcode-algorithm/tree/master/Swap%20Salary)
+628. [Maximum Product of Three Numbers](https://github.com/assassint2017/leetcode-algorithm/tree/master/Maximum%20Product%20of%20Three%20Numbers)
 674. [Longest Continuous Increasing Subsequence](https://github.com/assassint2017/leetcode-algorithm/tree/master/Longest%20Continuous%20Increasing%20Subsequence)
 692. [Top K Frequent Words](https://github.com/assassint2017/leetcode-algorithm/tree/master/Top%20K%20Frequent%20Words)
 697. [Degree of an Array](https://github.com/assassint2017/leetcode-algorithm/tree/master/Degree%20of%20an%20Array)