stripe phone screen 挂经

今天收到拒信 更新一下地里挺难找的stripe的phone screen。
面到的并不是http的题目 而是一道判断server的remove时间与对应的penalty的题。
1.a是给你一个由0与1组成的string 然后让输入一个时间去remove这个server，让你计算这个情况下penalty的大小。 penalty的计算规则为：
在一个string中， 0意味着这时候德server应该正常运行，1意味着这时候的server会d

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

ool来判断每次遇到END的时候前面是不是有open的BEGIN,有的话那中间的content就可以用1.b算出结果，然后再把bool复位到false即可。

到2.a的时候思路卡壳了，加之前面和小哥交流花了点时间，遂卒。 祝各位好运。

请问投了过后多久收到oa和电面的呢？谢谢！

Share a solution to crash stripe will you please give 评分加米

1. 
   
2. import java.util.*;
   
3. 
   
4. public class RemoveServe {
   
5. 
   
6.   /*
   
7.     Question comes from
   
8.      https://www.1point3acres.com/bbs/thread-780948-1-1.html
   
9.      https://1o24bbs.com/t/topic/5821/10
   
10.      https://www.1point3acres.com/bbs/thread-802334-1-1.html
    
11. 
    
12.     Part 1
    
13.             Given logs and removed_time calculate the total penalty score
    
14.             logs consist of 0 and 1 in one string
    
15.             ex) "0 0 0 1 0 0"
    
16.             0 means the server was up and running
    
17.             1 means the server was down and not functioning
    
18. 
    
19.             if the server is taken down too early you get a +1 penalty for reach the running server
    
20.             after removed_time
    
21.             if the server is taken down too late, you get a +1 penalty for reach a server that was
    
22.             down before removed_time
    
23. 
    
24.             Example 1
    
25. 
    
26.             "0 0 1 0" remove_time = 2 (0 based index)
    
27.             when the server is shut down, there is a penalty of 1 since during time 3rd and 4th
    
28.             log 4th indicated it was on when it should have been off.
    
29.             penalty = 1
    
30. 
    
31.             Example 2
    
32.             "0 0 1 0" remove_time = 0 index
    
33.             penalty = 3
    
34.             log 1st, 2nd, 4th was on when it should have been off
    
35. 
    
36.             Example 3
    
37.             "1 1 1 0" remove_time = 0 index
    
38.             penalty = 1
    
39.             only log 4th was on when it should have been off
    
40. 
    
41.     Part 2
    
42.             write another function to give logs find when is the best time to take the server down
    
43. 
    
44.             Example
    
45.             log "1 1 1 0"
    
46.             best_time = 0  0-based index
    
47.             because for time 1 2 3 4 penalties will be 2 3 4 3
    
48.             at time 1th penalty is 1 which is the lowest
    
49. 
    
50.             log   "1 0 0"
    
51.                    0 1 1
    
52.                    2 2 1
    
53.            penalty 2 3 2, there 2 time with the lowest penalty,
    
54.           how to select now: index 0 or 2 ??
    
55. 
    
56.   Part 3
    
57. 
    
58.             write another function which can take in logs
    
59.             this time with 'BEGIN' 'END' '0' '1' '\n'
    
60.             they can be out of order
    
61.             There are no nested loops
    
62. 
    
63.             ex) 'BEGIN END BEGIN BEGIN 1 0 0 END END 0 0 1'
    
64.             The only valid sequence is
    
65.                                  BEGIN 1 0 0 END
    
66.             It must start with BEGIN and ‍‌‍‌‌‍‌‌‍‍‌‍‍‌‍‍‌‌end with END
    
67.             There can be multiple valid sequences,
    
68.             return a list of the best times to take the server down
    
69. 
    
70.             Example 1
    
71.             "BEGIN BEGIN 1 0 0 END"
    
72.             return [2] 1-based index
    
73.             because the valid sequence is "1 0 0" now use
    
74.             the function we wrote in part 2 and return  it in a list.
    
75. 
    
76.             Example 2  1-based index
    
77.             "BEGIN BEGIN 1 0 0 END 0 0 0 1 BEGIN 1 1 1 0 END"
    
78.             return [2, 0]
    
79.             valid sequence is "1 0 0" and "1 1 1 0"*/
    
80. 
    
81.   public static int getPenalty(String line, int removed) {
    
82.     if (line == null || line.length() == 0) return 0;
    
83.     String[] digits = line.split("\\s");
    
84.     int r = 0;
    
85.     for (int i = 0; i < digits.length; i++) {
    
86.       if ((i < removed && digits[i].equals("1")) || (i >= removed && digits[i].equals("0"))) {
    
87.         r++;
    
88.       }
    
89.     }
    
90.     return r;
    
91.   }
    
92. 
    
93.   public static int bestTimeToShutDown(String line) {
    
94.     if (line == null || line.length() == 0) return -1;
    
95. 
    
96.     String[] digits = line.split("\\s");
    
97.     int N = digits.length;
    
98.     int[] nozero = new int[N];
    
99.     int nozSum = 0;
    
100.     for (int i = 1; i < N; i++) {
     
101.       if (digits[i - 1].equals("1")) nozSum++;
     
102.       nozero[i] = nozSum;
     
103.     }
     
104.     int minP = Integer.MAX_VALUE, r = -1;
     
105.     int no1 = 0;
     
106.     for (int i = N - 1; i >= 0; i--) {
     
107.       if (digits[i].equals("0")) no1++;
     
108.       if (no1 + nozero[i] < minP) {
     
109.         minP = no1 + nozero[i];
     
110.         r = i;
     
111.       }
     
112.     }
     
113.     return r;
     
114.   }
     
115. 
     
116.   public static List<Integer> parseLogs(String line) {
     
117.     String[] cuts = line.split("\\s");
     
118.     int start = -1, end = -1;
     
119.     int i = 0;
     
120.     List<String> logs = new ArrayList<>();
     
121.     while (i < cuts.length) {
     
122.       if (i > 0 && cuts[i].length() == 1 && Character.isDigit(cuts[i].charAt(0))) {
     
123.         start = i - 1;
     
124.         StringBuilder s = new StringBuilder();
     
125.         while (i < cuts.length && cuts[i].length() == 1 && Character.isDigit(cuts[i].charAt(0))) {
     
126.           s.append(cuts[i]).append(" ");
     
127.           i++;
     
128.         }
     
129.         if (i < cuts.length && cuts[i].equals("END") && cuts[start].equals("BEGIN")) {
     
130.           logs.add(s.toString());
     
131.         }
     
132.       } else {
     
133.         i++;
     
134.       }
     
135.     }
     
136.     List<Integer> r = new LinkedList<>();
     
137.     for (String log : logs) {
     
138.       r.add(bestTimeToShutDown(log));
     
139.     }
     
140.     return r;
     
141.   }
     
142. 
     
143.   public static void main(String[] args) {
     
144.     System.out.println(getPenalty("0 0 1 0", 2) == 1);
     
145.     System.out.println(getPenalty("0 0 1 0", 0) == 3);
     
146.     System.out.println(getPenalty("1 1 1 0", 0) == 1);
     
147. 
     
148.     System.out.println(bestTimeToShutDown("1 1 1 0") == 0);
     
149.     System.out.println(bestTimeToShutDown("0 0 1 0") == 2);
     
150.     System.out.println(bestTimeToShutDown("1 1 0") == 0);
     
151.     System.out.println(bestTimeToShutDown("1 0 0") == 2); // 0 or 2
     
152. 
     
153.     System.out.println(
     
154.         Arrays.toString(parseLogs("BEGIN END BEGIN BEGIN 1 0 0 END END 0 0 1").toArray())
     
155.             .equals("[2]"));
     
156.     System.out.println(Arrays.toString(parseLogs("BEGIN BEGIN 1 0 0 END").toArray()).equals("[2]"));
     
157.     System.out.println(
     
158.         Arrays.toString(parseLogs("BEGIN BEGIN 1 0 0 END 0 0 0 1 BEGIN 1 1 1 0 END").toArray())
     
159.             .equals("[2, 0]"));
     
160.   }

复制代码

Phone screen 是那个oa之后的一轮店面吗

When did you apply online? I heard they are full for interns. Is it true?

这个实现have bug吧。 100 的最佳移除时机是3， 也就是4小时的地方，其惩罚因子是1