add hdu_2000

yi-yun · yi-yun · commit 782e44da365d · 2019-06-30T14:30:43.000+08:00
diff --git a/.idea/compiler.xml b/.idea/compiler.xml
diff --git a/java_test/src/main/java/com/yiyun/Main.java b/java_test/src/main/java/com/yiyun/Main.java
@@ -0,0 +1,16 @@
+package com.yiyun;
+
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String args[]) {
+        Scanner cin = new Scanner(System.in);
+        int a, b;
+
+        while (cin.hasNextInt()) {
+            a = cin.nextInt();
+            b = cin.nextInt();
+            System.out.println(a + b);
+        }
+    }
+}
diff --git a/myoffer/src/main/java/hdu/_2000ASCIISort.java b/myoffer/src/main/java/hdu/_2000ASCIISort.java
@@ -0,0 +1,28 @@
+package hdu;
+
+import java.util.Scanner;
+
+public class _2000ASCIISort {
+    public static void main(String[] args) {
+        Scanner cin = new Scanner(System.in);
+        String s=null;
+        while (cin.hasNext()) {
+            s = cin.nextLine();
+            char[] chars = s.toCharArray();
+            for (int i = 0; i < s.length(); i++) {
+                for (int j = 0; j < s.length() - 1 - i; j++) {
+                    if (chars[j] > chars[j + 1]) {
+                        char tmp = chars[j];
+                        chars[j] = chars[j + 1];
+                        chars[j + 1] = tmp;
+                    }
+                }
+            }
+            int i=0;
+            for (i = 0; i < chars.length-1; i++) {
+                System.out.print(chars[i]+" ");
+            }
+            System.out.println(chars[i]);
+        }
+    }
+}
diff --git a/myoffer/src/main/java/leetcode/array/LC_349.java b/myoffer/src/main/java/leetcode/array/LC_349.java
@@ -7,7 +7,7 @@ public class LC_349 {
     /**
      * @param nums1
      * @param nums2
-     * @return int[]
+     * @return int[]2
      */
     public int[] intersection(int[] nums1, int[] nums2) {
         HashSet<Integer> hashSet = new HashSet<>();
