update

Author: shuzijun

.idea/leetcode-pro/editor.xml

@@ -4,16 +4,16 @@
 ## leetcode-editor config  
   CodeFileName:
   ```java
-  $!velocityTool.camelCaseName(${question.titleSlug})
+  Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})
   ```
   CodeTemplate:
   ```java
+    package com.shuzijun.leetcode.editor.cn;
     ${question.content}
 
-    package com.shuzijun.leetcode.editor.en;
-    public class $!velocityTool.camelCaseName(${question.titleSlug}){
-        public static void main(String[] args) {
-             Solution solution = new $!velocityTool.camelCaseName(${question.titleSlug})().new Solution();
+    public class Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug}){
+    public static void main(String[] args) {
+        Solution solution = new Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})().new Solution();
         }
         ${question.code}
     }

README.md

@@ -0,0 +1,47 @@
+package com.shuzijun.leetcode.editor.cn;
+/**
+<p>给定两个整数，被除数&nbsp;<code>dividend</code>&nbsp;和除数&nbsp;<code>divisor</code>。将两数相除，要求不使用乘法、除法和 mod 运算符。</p>
+
+<p>返回被除数&nbsp;<code>dividend</code>&nbsp;除以除数&nbsp;<code>divisor</code>&nbsp;得到的商。</p>
+
+<p>整数除法的结果应当截去（<code>truncate</code>）其小数部分，例如：<code>truncate(8.345) = 8</code> 以及 <code>truncate(-2.7335) = -2</code></p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例&nbsp;1:</strong></p>
+
+<pre><strong>输入:</strong> dividend = 10, divisor = 3
+<strong>输出:</strong> 3
+<strong>解释: </strong>10/3 = truncate(3.33333..) = truncate(3) = 3</pre>
+
+<p><strong>示例&nbsp;2:</strong></p>
+
+<pre><strong>输入:</strong> dividend = 7, divisor = -3
+<strong>输出:</strong> -2
+<strong>解释:</strong> 7/-3 = truncate(-2.33333..) = -2</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li>被除数和除数均为 32 位有符号整数。</li>
+	<li>除数不为&nbsp;0。</li>
+	<li>假设我们的环境只能存储 32 位有符号整数，其数值范围是 [&minus;2<sup>31</sup>,&nbsp; 2<sup>31&nbsp;</sup>&minus; 1]。本题中，如果除法结果溢出，则返回 2<sup>31&nbsp;</sup>&minus; 1。</li>
+</ul>
+<div><div>Related Topics</div><div><li>位运算</li><li>数学</li></div></div><br><div><li>👍 625</li><li>👎 0</li></div>
+*/
+  
+public class Q29DivideTwoIntegers{
+  public static void main(String[] args) {
+       Solution solution = new Q29DivideTwoIntegers().new Solution();
+  }
+  //leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public int divide(int dividend, int divisor) {
+        return 0;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

src/main/java/com/shuzijun/leetcode/editor/cn/Q29DivideTwoIntegers.java

@@ -0,0 +1,62 @@
+package com.shuzijun.leetcode.editor.cn;
+
+import java.util.List;
+
+/**
+<p>给定一个字符串 <code>s</code><strong> </strong>和一些 <strong>长度相同</strong> 的单词 <code>words</code><strong> 。</strong>找出 <code>s</code><strong> </strong>中恰好可以由 <code>words</code><strong> </strong>中所有单词串联形成的子串的起始位置。</p>
+
+<p>注意子串要与 <code>words</code><strong> </strong>中的单词完全匹配，<strong>中间不能有其他字符 </strong>，但不需要考虑 <code>words</code><strong> </strong>中单词串联的顺序。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "barfoothefoobarman", words = ["foo","bar"]
+<strong>输出：</strong><code>[0,9]</code>
+<strong>解释：</strong>
+从索引 0 和 9 开始的子串分别是 "barfoo" 和 "foobar" 。
+输出的顺序不重要, [9,0] 也是有效答案。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "wordgoodgoodgoodbestword", words = ["word","good","best","word"]
+<code><strong>输出：</strong>[]</code>
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "barfoofoobarthefoobarman", words = ["bar","foo","the"]
+<strong>输出：</strong>[6,9,12]
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
+	<li><code>s</code> 由小写英文字母组成</li>
+	<li><code>1 <= words.length <= 5000</code></li>
+	<li><code>1 <= words[i].length <= 30</code></li>
+	<li><code>words[i]</code> 由小写英文字母组成</li>
+</ul>
+<div><div>Related Topics</div><div><li>哈希表</li><li>字符串</li><li>滑动窗口</li></div></div><br><div><li>👍 510</li><li>👎 0</li></div>
+*/
+  
+public class Q30SubstringWithConcatenationOfAllWords{
+  public static void main(String[] args) {
+       Solution solution = new Q30SubstringWithConcatenationOfAllWords().new Solution();
+  }
+  //leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public List<Integer> findSubstring(String s, String[] words) {
+        return null;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

src/main/java/com/shuzijun/leetcode/editor/cn/Q30SubstringWithConcatenationOfAllWords.java

@@ -0,0 +1,97 @@
+package com.shuzijun.leetcode.editor.cn;
+
+import java.util.Arrays;
+
+/**
+ * <p>实现获取 <strong>下一个排列</strong> 的函数，算法需要将给定数字序列重新排列成字典序中下一个更大的排列。</p>
+ *
+ * <p>如果不存在下一个更大的排列，则将数字重新排列成最小的排列（即升序排列）。</p>
+ *
+ * <p>必须<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地 </a></strong>修改，只允许使用额外常数空间。</p>
+ *
+ * <p> </p>
+ *
+ * <p><strong>示例 1：</strong></p>
+ *
+ * <pre>
+ * <strong>输入：</strong>nums = [1,2,3]
+ * <strong>输出：</strong>[1,3,2]
+ * </pre>
+ *
+ * <p><strong>示例 2：</strong></p>
+ *
+ * <pre>
+ * <strong>输入：</strong>nums = [3,2,1]
+ * <strong>输出：</strong>[1,2,3]
+ * </pre>
+ *
+ * <p><strong>示例 3：</strong></p>
+ *
+ * <pre>
+ * <strong>输入：</strong>nums = [1,1,5]
+ * <strong>输出：</strong>[1,5,1]
+ * </pre>
+ *
+ * <p><strong>示例 4：</strong></p>
+ *
+ * <pre>
+ * <strong>输入：</strong>nums = [1]
+ * <strong>输出：</strong>[1]
+ * </pre>
+ *
+ * <p> </p>
+ *
+ * <p><strong>提示：</strong></p>
+ *
+ * <ul>
+ * <li><code>1 <= nums.length <= 100</code></li>
+ * <li><code>0 <= nums[i] <= 100</code></li>
+ * </ul>
+ * <div><div>Related Topics</div><div><li>数组</li><li>双指针</li></div></div><br><div><li>👍 1247</li><li>👎 0</li></div>
+ */
+
+public class Q31NextPermutation {
+    public static void main(String[] args) {
+        Solution solution = new Q31NextPermutation().new Solution();
+        int[] nums = new int[]{2,3,1};
+        solution.nextPermutation(nums);
+        System.out.println(Arrays.toString(nums));
+    }
+
+    // [4,5,2,6,3,1]
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public void nextPermutation(int[] nums) {
+            int i = nums.length - 2;
+            while (i >= 0 && nums[i] >= nums[i + 1]) {
+                i--;
+            }
+            if (i >= 0) {
+                int j = nums.length - 1;
+                while (j >= 0 && nums[i] >= nums[j]) {
+                    j--;
+                }
+                swap(nums, i, j);
+            }
+            reverse(nums, i + 1);
+        }
+
+        public void swap(int[] nums, int i, int j) {
+            int temp = nums[i];
+            nums[i] = nums[j];
+            nums[j] = temp;
+        }
+
+        public void reverse(int[] nums, int start) {
+            int left = start, right = nums.length - 1;
+            while (left < right) {
+                swap(nums, left, right);
+                left++;
+                right--;
+            }
+        }
+
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}