华为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;
}
全部评论
相关推荐
xiaowl:你这个简历“条目上”都比较有深度性,但是实际上面试官又没法很好的评估你是怎么达到很多看上去很厉害的结果的。要避免一些看上去很厉害的包装,比如高效的内存复用策略的表达,如果仅是简单的一些内存共享机制,而且面试上也没有深挖的空间,就不要这样表达。比如,工程化模式本质上可能就是定义了一些abstract class,那也就没特别多值得讲的内容。建议简历上应该侧重那些你花了大量时间和精力解决、研究的问题,不要过分追求“丰富”,而是关注在技术深入度、问题解决能力的表现上。 点赞 评论 收藏
分享
查看21道真题和解析 点赞 评论 收藏
分享

