add 2177

Author: Steve Sun

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |------|----------------|---------------|--------|-------------|-------------
+| 2177 |[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) ||Medium||
 | 2176 |[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2176.java) ||Easy||
 | 2169 |[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2169.java) ||Easy||
 | 2166 |[Design Bitset](https://leetcode.com/problems/design-bitset/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2166.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2177.java

@@ -0,0 +1,15 @@
+package com.fishercoder.solutions;
+
+public class _2177 {
+    public static class Solution1 {
+        public long[] sumOfThree(long num) {
+            long remainder = num % 3;
+            long ave = num / 3;
+            if (remainder == 0) {
+                return new long[]{ave - 1, ave, ave + 1};
+            } else {
+                return new long[]{};
+            }
+        }
+    }
+}