操作序列

DreamCats · DreamCats · commit da545797bb4a · 2020-08-16T00:26:17.000+08:00
diff --git a/Interview/bishi/wangyi.md b/Interview/bishi/wangyi.md
@@ -1760,4 +1760,41 @@ public class Main {
         System.out.println(res);
     }
 }
+```
+
+## 操作序列
+
+[https://www.nowcoder.com/practice/b53bda356a494154b6411d80380295f5?tpId=122&&tqId=33683&rp=1&ru=/ta/exam-wangyi&qru=/ta/exam-wangyi/question-ranking](https://www.nowcoder.com/practice/b53bda356a494154b6411d80380295f5?tpId=122&&tqId=33683&rp=1&ru=/ta/exam-wangyi&qru=/ta/exam-wangyi/question-ranking)
+
+```java
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int[] a = new int[n];
+        for (int i = 0; i < n; i++) {
+            a[i] = sc.nextInt();
+        }
+        if (n == 1)
+            System.out.println(a[0]);
+        if (n % 2 == 0) {
+            for (int i = n - 1; i >= 0; i -=2)
+                System.out.print(a[i] + " ");
+            for (int i = 0; i < n - 2; i += 2)
+                System.out.print(a[i] + " ");
+            System.out.print(a[n - 2]);
+        }
+        else {
+            for (int i = n - 1; i >= 0; i -= 2) {
+                System.out.print(a[i] + " ");
+            }
+            for (int i = 1; i < n - 2; i += 2) 
+                System.out.print(a[i] + " ");
+            System.out.print(a[n-2]);
+        }
+    }
+}
+
 ```
diff --git a/Interview/src/Main.java b/Interview/src/Main.java
@@ -1,19 +1,23 @@
+import java.util.ArrayList;
+import java.util.Collections;
 import java.util.Scanner;
 
 public class Main {
     public static void main(String[] args) {
         Scanner sc = new Scanner(System.in);
-        String s = sc.nextLine();
-        int len = 1;
-        int res = 1;
-        for (int i = 1; i < s.length(); i++) {
-            if (s.charAt(i) != s.charAt(i - 1)) {
-                len++;
-                res = Math.max(len, res);
-            } else {
-                len = 1;
-            }
+        int n = sc.nextInt();
+        int[] a = new int[n];
+        for (int i = 0; i < n; i++) {
+            a[i] = sc.nextInt();
         }
-        System.out.println(res);
+        ArrayList<Integer> list = new ArrayList<>();
+        for (int i = 0; i < n; i++) {
+            list.add(a[i]);
+            Collections.reverse(list);
+        }
+        StringBuilder sb = new StringBuilder();
+        list.forEach(o -> sb.append(o + " "));
+        System.out.println(sb.substring(0, sb.length() - 1));
+
     }
 }
