注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
刚做的小金人oa 两道coding + 9道数学
coding 第一道题是 Is possible, leetocde 780
Given four integers a, b, c and d, return 'Yes' if it is possible to convert the point (a, b) to the point (c, d) through some operations, or "No" otherwise. 唯一区别应该就是return 'Yes No' 而不是True false.具体做法就是反向的dfs,具体leetcode上有很详细的解法!
coding 第二道题是whole minute dilemma. leetcode 1010. 具体做法用的hashmap
dic = {int:0}, 在coin is fair with certainty p=0.01
B the coin is not fair with certainty p < 0.01
C the coin is not fair with certainty p < 0.1, but not p < 0.01
D the coin is fair with certainty p < 0.1, but not p < 0.01
希望大家招工顺利呀! |