Solution to today's problem

src/main/java/io/github/spannm/leetcode/lc0/lc0900/Problem0948.java

@@ -13,21 +13,21 @@ public int bagOfTokensScore(int[] _tokens, int _power) {
         Arrays.sort(_tokens);
         int i = 0;
         int j = _tokens.length - 1;
-        int ans = 0;
+        int result = 0;
         int t = 0;
         while (i <= j) {
             if (_power >= _tokens[i]) {
                 _power -= _tokens[i++];
                 t++;
-                ans = Math.max(ans, t);
+                result = Math.max(result, t);
             } else if (t > 0) {
                 _power += _tokens[j--];
                 t--;
             } else {
                 break;
             }
         }
-        return ans;
+        return result;
     }
 
 }

src/test/java/io/github/spannm/leetcode/lc0/lc0900/Problem0948Test.java

@@ -0,0 +1,21 @@
+package io.github.spannm.leetcode.lc0.lc0900;
+
+import io.github.spannm.leetcode.LeetcodeBaseTest;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.converter.ConvertWith;
+import org.junit.jupiter.params.provider.CsvSource;
+
+class Problem0948Test extends LeetcodeBaseTest {
+
+    @ParameterizedTest(name = "[{index}] {0}; {1} --> {2}")
+    @CsvSource(delimiter = ';', value = {
+        "100; 50; 0",
+        "200,100; 150; 1",
+        "100,200,300,400; 200; 2"
+
+    })
+    void test(@ConvertWith(CsvToIntArray.class) int[] _tokens, int _power, int _expectedResult) {
+        assertEquals(_expectedResult, new Problem0948().bagOfTokensScore(_tokens, _power));
+    }
+
+}