Jim is in the market for a car that will last for the next 10 years and has saved up some money for the purpose of a car. What’s
1 answer:
You might be interested in
#include <iostream>
#include <vector>
std::vector<int> v;
int main(int argc, char* argv[]) {
while(1) {
int temp;
std::cout << "\nEnter a number: ";std::cin>>temp;
if(temp<0) {
std::cout << "\nEven number(s) is/are:\n---------------------\n";
for(int i=0;i<v.size();i++) {
if(v.at(i)%2==0) std::cout << v[i] << " ";
else continue;
}
std::cout << std::endl;
break;
}else {
v.push_back(temp);
}
}
return 0;
}
Answer:
Explanation:
The following code is written in Python. It is a recursive function that tests the first and last character of the word and keeps checking to see if each change would create the palindrome. Finally, printing out the minimum number needed to create the palindrome.
import sys
def numOfSwitches(word, start, end):
if (start > end):
return sys.maxsize
if (start == end):
return 0
if (start == end - 1):
if (word[start] == word[end]):
return 0
else:
return 1
if (word[start] == word[end]):
return numOfSwitches(word, start + 1, end - 1)
else:
return (min(numOfSwitches(word, start, end - 1),
numOfSwitches(word, start + 1, end)) + 1)
word = input("Enter a Word: ")
start = 0
end = len(word)-1
print("Number of switches required for palindrome: " + str(numOfSwitches(word, start, end)))
