diff --git a/java-leetcode/src/main/java/io/github/wkk/TwoSum.java b/java-leetcode/src/main/java/io/github/wkk/TwoSum.java
new file mode 100644
index 0000000000000000000000000000000000000000..9de15040b746af94d4f37881a01f7454f5dba4d4
--- /dev/null
+++ b/java-leetcode/src/main/java/io/github/wkk/TwoSum.java
@@ -0,0 +1,10 @@
+package io.github.wkk;
+
+/**
+ * @Time: 2020/7/30上午9:18
+ * @Author: kongwiki
+ * @Email: kongwiki@163.com
+ */
+public class TwoSum {
+
+}
diff --git a/java-leetcode/src/main/java/io/github/wkk/everyday/junly/IntegerBreak_343.java b/java-leetcode/src/main/java/io/github/wkk/everyday/junly/IntegerBreak_343.java
new file mode 100644
index 0000000000000000000000000000000000000000..26630f6ea2d752b944c0a31ab43ba6605173c7bc
--- /dev/null
+++ b/java-leetcode/src/main/java/io/github/wkk/everyday/junly/IntegerBreak_343.java
@@ -0,0 +1,26 @@
+package io.github.wkk.everyday.junly;
+
+/**
+ * @Time: 2020/7/30上午8:52
+ * @Author: kongwiki
+ * @Email: kongwiki@163.com
+ */
+public class IntegerBreak_343 {
+    public int integerBreak(int n) {
+        int division = 3;
+        if(n <=division){
+            if(n <= 2){
+                return 1;
+            }else {
+                return 2;
+            }
+        }
+        if(n%division == 0){
+            return (int)Math.pow(division, n/division);
+        }else if(n%division == 1){
+            return (int)Math.pow(division, n/division - 1) * 4;
+        }else {
+            return (int)Math.pow(division, n/division) * 2;
+        }
+    }
+}
diff --git a/java-leetcode/src/main/java/io/github/wkk/wkk.md b/java-leetcode/src/main/java/io/github/wkk/wkk.md
new file mode 100644
index 0000000000000000000000000000000000000000..32cda2f5b1f6b66fdbd4a57980fd7e7a8f738d96
--- /dev/null
+++ b/java-leetcode/src/main/java/io/github/wkk/wkk.md
@@ -0,0 +1,8 @@
+## 每日一题
+
+1. [343. 整数拆分](./everyday/junly/IntegerBreak_343.java)
+
+## 哈希表
+
+1. [1. 两数之和](./TwoSum.java)
+