In python 3.8:
def func(value_list):
lst = [x for x in value_list if type(x) == int or type(x) == float]
return sum(lst)
print(func(["h", "w", 32, 342.23, 'j']))
This is one solution using list comprehensions. I prefer this route because the code is concise.
def func(value_list):
total = 0
for x in value_list:
if type(x) == int or type(x) == float:
total += x
return total
print(func(["h", "w", 32, 342.23, 'j']))
This is the way as described in your problem.
The simulation, player 2 will always play according to the same strategy.
Method getPlayer2Move below is completed by assigning the correct value to result to be returned.
Explanation:
- You will write method getPlayer2Move, which returns the number of coins that player 2 will spend in a given round of the game. In the first round of the game, the parameter round has the value 1, in the second round of the game, it has the value 2, and so on.
#include <bits/stdc++.h>
using namespace std;
bool getplayer2move(int x, int y, int n)
{
int dp[n + 1];
dp[0] = false;
dp[1] = true;
for (int i = 2; i <= n; i++) {
if (i - 1 >= 0 and !dp[i - 1])
dp[i] = true;
else if (i - x >= 0 and !dp[i - x])
dp[i] = true;
else if (i - y >= 0 and !dp[i - y])
dp[i] = true;
else
dp[i] = false;
}
return dp[n];
}
int main()
{
int x = 3, y = 4, n = 5;
if (findWinner(x, y, n))
cout << 'A';
else
cout << 'B';
return 0;
}
Answer:
I think the answer is D but please let me know if i am wrong
Explanation:
