华为OD机试真题 - 最大股票收益
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String[] prices = in.nextLine().split(" ");
int[] pricesTemp = changeToRMB(prices);
System.out.println(getResult(pricesTemp));
}
public static int getResult(int[] prices) {
int sum = 0;
int price = 0;
for (int i = 0; i < prices.length; i++) {
if (isPeak(prices, i) && price != 0)
sum += prices[i] - price;
if (isValley(prices, i))
price = prices[i];
}
return sum;
}
public static int[] changeToRMB(String[] prices) {
int[] pricesTemp = new int[prices.length];
for (int i = 0; i < prices.length; i++) {
if (prices[i].endsWith("Y"))
pricesTemp[i] = Integer.parseInt(prices[i].substring(0, prices[i].length() - 1));
else
pricesTemp[i] = Integer.parseInt(prices[i].substring(0, prices[i].length() - 1)) * 7;
}
return pricesTemp;
}
public static boolean isPeak(int[] prices, int i) {
if (i == 0 && prices[i + 1] < prices[i])
return true;
else if (i == 0)
return false;
if (i == prices.length - 1 && prices[i - 1] < prices[i])
return true;
else if (i == prices.length - 1)
return false;
if (prices[i - 1] < prices[i] && prices[i + 1] < prices[i])
return true;
return false;
}
public static boolean isValley(int[] prices, int i) {
if (i == 0 && prices[i + 1] > prices[i])
return true;
else if (i == 0)
return false;
if (i == prices.length - 1 && prices[i - 1] > prices[i])
return true;
else if (i == prices.length - 1)
return false;
if (prices[i - 1] > prices[i] && prices[i + 1] > prices[i])
return true;
return false;
}
Scanner in = new Scanner(System.in);
String[] prices = in.nextLine().split(" ");
int[] pricesTemp = changeToRMB(prices);
System.out.println(getResult(pricesTemp));
}
public static int getResult(int[] prices) {
int sum = 0;
int price = 0;
for (int i = 0; i < prices.length; i++) {
if (isPeak(prices, i) && price != 0)
sum += prices[i] - price;
if (isValley(prices, i))
price = prices[i];
}
return sum;
}
public static int[] changeToRMB(String[] prices) {
int[] pricesTemp = new int[prices.length];
for (int i = 0; i < prices.length; i++) {
if (prices[i].endsWith("Y"))
pricesTemp[i] = Integer.parseInt(prices[i].substring(0, prices[i].length() - 1));
else
pricesTemp[i] = Integer.parseInt(prices[i].substring(0, prices[i].length() - 1)) * 7;
}
return pricesTemp;
}
public static boolean isPeak(int[] prices, int i) {
if (i == 0 && prices[i + 1] < prices[i])
return true;
else if (i == 0)
return false;
if (i == prices.length - 1 && prices[i - 1] < prices[i])
return true;
else if (i == prices.length - 1)
return false;
if (prices[i - 1] < prices[i] && prices[i + 1] < prices[i])
return true;
return false;
}
public static boolean isValley(int[] prices, int i) {
if (i == 0 && prices[i + 1] > prices[i])
return true;
else if (i == 0)
return false;
if (i == prices.length - 1 && prices[i - 1] > prices[i])
return true;
else if (i == prices.length - 1)
return false;
if (prices[i - 1] > prices[i] && prices[i + 1] > prices[i])
return true;
return false;
}
全部评论
相关推荐