From 0ccea1f59cd474f4028f303a42e3f74d0b92d8c7 Mon Sep 17 00:00:00 2001 From: starriddle Date: Fri, 10 Jul 2020 13:52:35 +0800 Subject: [PATCH 1/4] java 11 --- pom.xml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/pom.xml b/pom.xml index e847bda..2616875 100644 --- a/pom.xml +++ b/pom.xml @@ -23,8 +23,8 @@ 定义 maven-compiler-plugin 的 source & target 属性(java版本) 如不定义且未在插件中定义source和target属性，3.8(20180726) 以前 默认 1.5，以后 默认 1.6 --> - 1.8 - 1.8 + 11 + 11 From c0a38312c49767b6fde6be2e1d0373488bf89dfa Mon Sep 17 00:00:00 2001 From: starriddle Date: Fri, 10 Jul 2020 13:54:09 +0800 Subject: [PATCH 2/4] update .gitignore for leetcode plugin of IDEA --- .gitignore | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/.gitignore b/.gitignore index f834df7..bf1471a 100644 --- a/.gitignore +++ b/.gitignore @@ -41,4 +41,8 @@ RemoteSystemsTempFiles/ .DS_Store .ds_store ._* -Thumbs.db \ No newline at end of file +Thumbs.db + +### leetcode +/src/main/java/com/starriddle/starter/java/leetcode/editor/cn/all.json +/src/main/java/com/starriddle/starter/java/leetcode/editor/cn/translation.json From 27295698711889cd7db20a30e46038153d8c0ab4 Mon Sep 17 00:00:00 2001 From: starriddle Date: Tue, 9 Feb 2021 16:31:23 +0800 Subject: [PATCH 3/4] update to JDK 11 --- pom.xml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/pom.xml b/pom.xml index 2616875..ee8d578 100644 --- a/pom.xml +++ b/pom.xml @@ -81,13 +81,13 @@ 也可在此处自定义 如未定义，3.8(20180726) 以前 默认 1.5，以后 默认 1.6 --> - 1.8 + 11 - 1.8 + 11 返回 -3. +//minStack.pop(); +//minStack.top(); --> 返回 0. +//minStack.getMin(); --> 返回 -2. +// +// +// +// +// 提示： +// +// +// pop、top 和 getMin 操作总是在 非空栈 上调用。 +// +// Related Topics 栈 设计 +// 👍 616 👎 0 + +package com.starriddle.starter.java.leetcode.editor.cn; + +/** + * 155 + * 最小栈 + * min-stack + */ +public class L0155 { + + public static void main(String[] args) { + L0155 instance = new L0155(); + instance.test(); + } + + void test() { + // Solution solution = new Solution(); + // TODO + } + +//leetcode submit region begin(Prohibit modification and deletion) +class MinStack { + + int val; + MinStack next; + MinStack min; + + /** initialize your data structure here. */ + public MinStack() { + + } + + public void push(int x) { + MinStack stack = new MinStack(); + stack.val = x; + if (next==null) { + stack.min = stack; + next = stack; + } else { + stack.min = next.min.val > x ? stack : next.min; + stack.next = next; + next = stack; + } + } + + public void pop() { + next = next.next; + } + + public int top() { + return next.val; + } + + public int getMin() { + return next.min.val; + } +} + +/** + * Your MinStack object will be instantiated and called as such: + * MinStack obj = new MinStack(); + * obj.push(x); + * obj.pop(); + * int param_3 = obj.top(); + * int param_4 = obj.getMin(); + */ +//leetcode submit region end(Prohibit modification and deletion) + +} diff --git a/src/main/java/com/starriddle/starter/java/leetcode/editor/cn/L0171.java b/src/main/java/com/starriddle/starter/java/leetcode/editor/cn/L0171.java new file mode 100644 index 0000000..b4682ed --- /dev/null +++ b/src/main/java/com/starriddle/starter/java/leetcode/editor/cn/L0171.java @@ -0,0 +1,69 @@ +//给定一个Excel表格中的列名称，返回其相应的列序号。 +// +// 例如， +// +// A -> 1 +// B -> 2 +// C -> 3 +// ... +// Z -> 26 +// AA -> 27 +// AB -> 28 +// ... +// +// +// 示例 1: +// +// 输入: "A" +//输出: 1 +// +// +// 示例 2: +// +// 输入: "AB" +//输出: 28 +// +// +// 示例 3: +// +// 输入: "ZY" +//输出: 701 +// +// 致谢： +//特别感谢 @ts 添加此问题并创建所有测试用例。 +// Related Topics 数学 +// 👍 162 👎 0 + +package com.starriddle.starter.java.leetcode.editor.cn; + +/** + * 171 + * Excel表列序号 + * excel-sheet-column-number + */ +public class L0171 { + + public static void main(String[] args) { + L0171 instance = new L0171(); + instance.test(); + } + + void test() { + Solution solution = new Solution(); + // TODO + } + +//leetcode submit region begin(Prohibit modification and deletion) +class Solution { + public int titleToNumber(String s) { + int number = 0; + for (int index = 0; index < s.length(); index++) { + char c = s.charAt(index); + number = number * 26 + c + 1 - 'A'; + } + return number; + } +} +//leetcode submit region end(Prohibit modification and deletion) + +} diff --git a/src/main/java/com/starriddle/starter/java/util/RegexUtil.java b/src/main/java/com/starriddle/starter/java/util/RegexUtil.java new file mode 100644 index 0000000..6f07d12 --- /dev/null +++ b/src/main/java/com/starriddle/starter/java/util/RegexUtil.java @@ -0,0 +1,15 @@ +package com.starriddle.starter.java.util; + +/** + * description + * + * @author CYL + * @date 2019-08-01 + */ +public class RegexUtil { + public static void main(String[] args) { + String regex = ".+[0-9]{17}[0-9Xx]"; + String name = "A33221119990112668X"; + System.out.println(name.matches(regex)); + } +}