------
## 最终结论
```python
def pushDominoes(dominoes: str) -> str:
    n = len(dominoes)
    forces = [0] * n  # Create a list to store forces

    # Left to right pass
    force = 0
    for i in range(n):
        if dominoes[i] == 'R':
            force = n  # Set a large force value
        elif dominoes[i] == 'L':
            force = 0
        else:
            force = max(force - 1, 0)
        forces[i] += force

    # Right to left pass
    force = 0
    for i in range(n-1, -1, -1):
        if dominoes[i] == 'L':
            force = n  # Set a large force value
        elif dominoes[i] == 'R':
            force = 0
        else:
            force = max(force - 1, 0)
        forces[i] -= force

    result = []
    for f in forces:
        if f > 0:
            result.append('R')
        elif f < 0:
            result.append('L')
        else:
            result.append('.')

    return ''.join(result)

# Example usage:
print(pushDominoes(".L.R...LR..L..")) # Output: "LL.RR.LLRRLL.."
print(pushDominoes("RR.L"))           # Output: "RR.L"
```