def pig_latin(word):
if word[0].lower() in 'aeiou':
word = word + 'way'
else:
t=''
for x in range(len(word)):
if word[x].lower() in 'aeiou':
break
if word[x].lower() == 'y' and x>0:
break
else:
t+=word[x].lower()
if word[0].isupper():
word = word[len(t):]+word[:len(t)].lower()+'ay'
word = word.title()
else:
word = word[len(t):]+word[:len(t)].lower()+'ay'
return word
word = 'test'
pl = pig_latin(word)
print(pl)
I wrote my code in python 3.8. I hope this helps.
Answer:
If someone is disturbing you a lo then you can report him/her.
- Go to g-mail.
- Type a message to US Support.
- Add a screenshot of him/her whom you want to report.
- Use polite words
- At last, send it.
You will get soon response.
Answer:
The solution code is written in Python 3:
- def modifyList(listNumber):
- posCount = 0
- negCount = 0
-
- for x in listNumber:
- if x > 0:
- posCount += 1
- else:
- negCount += 1
-
- if(posCount == len(listNumber)):
- listNumber.append(max(listNumber))
-
- if(negCount == len(listNumber)):
- listNumber.append(min(listNumber))
-
- print(listNumber)
-
- modifyList([-1,-99,-81])
- modifyList([1,99,8])
- modifyList([-1,99,-81])
Explanation:
The key step to solve this problem is to define two variables, posCount and negCount, to track the number of positive value and negative value from the input list (Line 2 - 3).
To track the posCount and negCount, we can traverse through the for-loop and create if else statement to check if the current number x is bigger than 0 then increment posCount by 1 otherwise increment negCount (Line 5- 9).
If all number in the list are positive, the posCount should be equal to the length of the input list and the same rule is applied to negCount. If one of them happens, the listNumber will append either the maximum number (Line 11 -12) or append the minimum number (Line 14-15).
If both posCount and negCount are not equal to the list length, the block of code Line 11 -15 will be skipped.
At last we can print the listNumber (Line 17).
If we test our function using the three sets of input list, we shall get the following results:
[-1, -99, -81, -99]
[1, 99, 8, 99]
[-1, 99, -81]
The Pirates of Silicon Valley.
Tron
Hackers
Antitrust
The Social Network
The Internship
The Imitation Game
