1

leetcode/src/main/java/Main.java

@@ -0,0 +1,33 @@
+import java.util.Scanner;
+
+public class Main {
+
+    public static int question01() {
+        String str = new Scanner(System.in).nextLine();
+        String[] s = str.split(" ");
+        return s[s.length - 1].length();
+    }
+
+    public static void main(String[] args) {
+        System.out.println(question01());
+    }
+
+    public static void questionOne(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+
+        long num = scanner.nextLong();
+        int i = 2;
+        long end = (long) Math.sqrt(num);
+        while (i < end) {
+            if (num % i == 0) {
+                System.out.print(i + " ");
+                num = num / i;
+            } else {
+                i++;
+            }
+        }
+        if (num != 1) {
+            System.out.print(num + " ");
+        }
+    }
+}

leetcode/src/main/java/Solution513.java

@@ -0,0 +1,26 @@
+public class Solution513 {
+
+    private int level = 0;
+    private int value;
+
+    public int findBottomLeftValue(TreeNode root) {
+        dfs(root, level);
+        return this.value;
+    }
+
+    public void dfs(TreeNode node, int level) {
+        if (node == null) {
+            return;
+        }
+        if (level >= this.level) {
+            this.level = level;
+            this.value = node.val;
+        }
+        dfs(node.right, level + 1);
+        dfs(node.left, level + 1);
+    }
+
+    public static void main(String[] args) {
+
+    }
+}

leetcode/src/main/java/Solution515.java

@@ -0,0 +1,40 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class Solution515 {
+
+    public List<Integer> largestValues(TreeNode root) {
+        ArrayList<Integer> res = new ArrayList<>();
+        this.bfs(Arrays.asList(root), res);
+        return res;
+    }
+
+    public void bfs(List<TreeNode> nodes, List<Integer> res) {
+        if (nodes.size() == 0) {
+            return;
+        }
+
+        ArrayList<TreeNode> treeNodes = new ArrayList<>();
+        Integer max = null;
+
+        for (TreeNode node : nodes) {
+            if (node == null) {
+                continue;
+            }
+            if (max == null || node.val > max) {
+                max = node.val;
+            }
+            treeNodes.add(node.left);
+            treeNodes.add(node.right);
+        }
+        if (max != null) {
+            res.add(max);
+            bfs(treeNodes, res);
+        }
+
+    }
+
+    public static void main(String[] args) {
+    }
+}

leetcode/src/main/java/Solution518.java

@@ -0,0 +1,19 @@
+public class Solution518 {
+    public int change(int amount, int[] coins) {
+        int[] dp = new int[amount];
+        dp[0] = 1;
+        for (int i = 0; i < amount; i++) {
+            for (int coin : coins) {
+                if (i < coin) {
+                    continue;
+                }
+                dp[i] = Math.min(dp[i], dp[i - coin]);
+            }
+        }
+        return dp[amount];
+    }
+
+    public static void main(String[] args) {
+
+    }
+}

leetcode/src/main/java/TreeNode.java

@@ -0,0 +1,18 @@
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode() {
+    }
+
+    TreeNode(int val) {
+        this.val = val;
+    }
+
+    TreeNode(int val, TreeNode left, TreeNode right) {
+        this.val = val;
+        this.left = left;
+        this.right = right;
+    }
+}

test1/src/main/java/Main.java

@@ -0,0 +1,34 @@
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        //获取输入数据
+        Scanner scanner = new Scanner(System.in);
+        String numStr = scanner.nextLine();
+        String[] nums = numStr.split(",");
+
+        //存储临时变量
+        int lastIndex = 0;
+        int maxValue = 0;
+
+        //遍历前后数据
+        for (int i = 0; i < nums.length; i++) {
+            String num = nums[i];
+            if ("1".equals(num)) {
+                lastIndex = i;
+                continue;
+            }
+            for (int j = i + 1; j < nums.length; j++) {
+                if ("1".equals(nums[j])) {
+                    int max = Math.min(i - lastIndex, j - i);
+                    maxValue = Math.max(max, maxValue);
+                    break;
+                }
+                if (j == nums.length - 1) {
+                    maxValue = Math.max(maxValue, i - lastIndex);
+                }
+            }
+        }
+        System.out.println(maxValue);
+    }
+}

test1/src/main/java/Main02.java

@@ -0,0 +1,15 @@
+import java.util.Scanner;
+
+public class Main02 {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        String str1 = scanner.nextLine().toLowerCase();
+        String str2 = scanner.next().toLowerCase();
+        int index = -1;
+        int res = 0;
+        while ((index = str1.indexOf(str2, index+1)) >= 0) {
+            res++;
+        }
+        System.out.println(res);
+    }
+}

test1/src/main/java/Main2.java

@@ -0,0 +1,20 @@
+import java.util.HashMap;
+import java.util.Scanner;
+
+public class Main2 {
+    public static void main(String[] args) {
+        //String s = new Scanner(System.in).nextLine();
+        String s = "bcbcobc";
+        int count = 0;
+        for (int i = 0; i < s.length(); i++) {
+            if (s.charAt(i) == 'o') {
+                count++;
+            }
+        }
+        if (count % 2 == 0) {
+            System.out.println(s.length());
+        } else {
+            System.out.println(s.length() - 1);
+        }
+    }
+}

test1/src/main/java/Tmp.java

@@ -0,0 +1,4 @@
+public class Tmp {
+
+
+}

test1/src/main/java/main3.java

@@ -0,0 +1,35 @@
+import java.util.*;
+
+public class main3 {
+    public static void main(String[] args) {
+        //数据录入
+        Scanner scanner = new Scanner(System.in);
+        int len = Integer.parseInt(scanner.nextLine());
+        ArrayList<String> list = new ArrayList<>();
+        while (true) {
+            String s = scanner.nextLine();
+            if (s.trim().length() == 0) {
+                break;
+            }
+            list.add(s);
+        }
+        System.out.println("yes");
+        HashSet<Integer> integers = new HashSet<>();
+        integers.add(0);
+        dfs(0, list, integers);
+        System.out.println(integers);
+    }
+
+    public static void dfs(Integer num, ArrayList<String> list, HashSet<Integer> integers) {
+        int nextNum = 0;
+        if (integers.contains(num)) {
+            String[] s1 = list.get(0).split(" ");
+            if (integers.contains(Integer.parseInt(s1[0]))) {
+                nextNum = Integer.parseInt(s1[0]);
+                integers.add(nextNum);
+            }
+            dfs(nextNum, list, integers);
+        }
+
+    }
+}

test1/src/main/java/tmp.java

@@ -1,6 +0,0 @@
-
-public class tmp {
-    public static void main(String[] args) throws InterruptedException {
-
-    }
-}