-
Notifications
You must be signed in to change notification settings - Fork 0
/
1221balancedStringSplit.py
52 lines (43 loc) · 1.11 KB
/
1221balancedStringSplit.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#A program that counts the times a given string can be split in a way where the parts are "balanced" (same amount of matching letters)
#PASSING. 34ms runtime (beats 43%) and 13.7MB memory usage (beats 9%)
def balancedStringSplit(s):
r, l = 0, 0
counter = 0
for elem in s:
if elem == "L":
l += 1
elif elem =="R":
r += 1
if r==l:
counter += 1
r, l = 0,0
return counter
s= "RLRRLLRLRL"
print(balancedStringSplit(s))
#PASSING. 42ms runtime (beats 13.95%) and 13.3MB memory usage (beats 97%)
'''
def balancedStringSplit(s):
r, counter = 0, 0
for elem in s:
if elem == "R":
r += 1
else:
r += -1
if r == 0:
counter += 1
return counter
'''
#PASSING. 42ms runtime (beats 13.95%) and 13.5MB memory usage (beats 30%)
'''
def balancedStringSplit(s):
ret = 0
counter = 0
for letter in s:
if letter == "L":
ret = ret + 1
else:
ret = ret - 1
if ret == 0:
counter = counter + 1
return counter
'''