add 2660

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -20,6 +20,7 @@
 | 2673 | [Make Costs of Paths Equal in a Binary Tree](https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2673.java)                                       |                                      | Medium                         |Tree, DFS, Greedy
 | 2678 | [Number of Senior Citizens](https://leetcode.com/problems/number-of-senior-citizens/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2678.java)                                       |                                      | Easy                           |
 | 2670 | [Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2670.java)                                       |                                      | Easy                           |
+| 2660 | [Determine the Winner of a Bowling Game](https://leetcode.com/problems/determine-the-winner-of-a-bowling-game/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2660.java)                                       |                                      | Easy                           |
 | 2643 | [Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2643.java)                                       |                                      | Easy                           |
 | 2641 | [Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2641.java)                                       |                                      | Medium                         |Tree, BFS, HashTable
 | 2605 | [Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2605.java)                                       |                                      | Easy                           |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2660.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2660 {
+    public static class Solution1 {
+        public int isWinner(int[] player1, int[] player2) {
+            int sum1 = computeSum(player1);
+            int sum2 = computeSum(player2);
+            if (sum1 < sum2) {
+                return 2;
+            } else if (sum1 > sum2) {
+                return 1;
+            } else {
+                return 0;
+            }
+        }
+
+        private int computeSum(int[] pins) {
+            int sum = 0;
+            for (int i = 0; i < pins.length; i++) {
+                if (i > 0 && pins[i - 1] == 10 || (i > 1 && pins[i - 2] == 10)) {
+                    sum += pins[i] * 2;
+                } else {
+                    sum += pins[i];
+                }
+            }
+            return sum;
+        }
+    }
+}