LeetCode Solutions
class Solution {
public:
vector<string> generatePossibleNextMoves(string currentState) {
vector<string> ans;
for (int i = 0; i + 1 < currentState.length(); ++i)
if (currentState[i] == '+' && currentState[i + 1] == '+')
ans.push_back(currentState.substr(0, i) + "--" +
currentState.substr(i + 2));
return ans;
}
};
|
class Solution {
public List<String> generatePossibleNextMoves(String currentState) {
List<String> ans = new ArrayList<>();
for (int i = 0; i + 1 < currentState.length(); ++i)
if (currentState.charAt(i) == '+' && currentState.charAt(i + 1) == '+') {
StringBuilder sb = new StringBuilder(currentState);
sb.setCharAt(i, '-');
sb.setCharAt(i + 1, '-');
ans.add(sb.toString());
}
return ans;
}
}
|
class Solution:
def generatePossibleNextMoves(self, currentState: str) -> List[str]:
return [currentState[:i] + '--' + currentState[i + 2:]
for i, (a, b) in enumerate(zip(currentState, currentState[1:]))
if a == '+' and b == '+']
|
