提交 f0452052 编写于 作者: 梦境迷离's avatar 梦境迷离

add contributions and format

上级 b2aa716a
......@@ -62,6 +62,15 @@
"contributions": [
"code"
]
},
{
"login": "KongWiki",
"name": "weikunkun",
"avatar_url": "https://avatars0.githubusercontent.com/u/19886738?v=4",
"profile": "https://kongwiki.me/",
"contributions": [
"code"
]
}
],
"projectName": "cs-summary-reflection",
......
......@@ -65,6 +65,7 @@ For details, please see [CONTRIBUTING](./CONTRIBUTING-en.md)
<td align="center"><a href="https://github.com/LaoZhangCoder"><img src="https://avatars3.githubusercontent.com/u/28627858?v=4?s=100" width="100px;" alt=""/><br /><sub><b>laozhang</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=LaoZhangCoder" title="Code">💻</a></td>
<td align="center"><a href="https://github.com/CCCCmaster"><img src="https://avatars3.githubusercontent.com/u/25200717?v=4?s=100" width="100px;" alt=""/><br /><sub><b>CCCCmaster</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=CCCCmaster" title="Code">💻</a></td>
<td align="center"><a href="https://github.com/poorguy"><img src="https://avatars1.githubusercontent.com/u/624653?v=4?s=100" width="100px;" alt=""/><br /><sub><b>poorguy</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=poorguy" title="Code">💻</a></td>
<td align="center"><a href="https://kongwiki.me/"><img src="https://avatars0.githubusercontent.com/u/19886738?v=4?s=100" width="100px;" alt=""/><br /><sub><b>weikunkun</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=KongWiki" title="Code">💻</a></td>
</tr>
</table>
......
......@@ -65,6 +65,7 @@
<td align="center"><a href="https://github.com/LaoZhangCoder"><img src="https://avatars3.githubusercontent.com/u/28627858?v=4?s=100" width="100px;" alt=""/><br /><sub><b>laozhang</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=LaoZhangCoder" title="Code">💻</a></td>
<td align="center"><a href="https://github.com/CCCCmaster"><img src="https://avatars3.githubusercontent.com/u/25200717?v=4?s=100" width="100px;" alt=""/><br /><sub><b>CCCCmaster</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=CCCCmaster" title="Code">💻</a></td>
<td align="center"><a href="https://github.com/poorguy"><img src="https://avatars1.githubusercontent.com/u/624653?v=4?s=100" width="100px;" alt=""/><br /><sub><b>poorguy</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=poorguy" title="Code">💻</a></td>
<td align="center"><a href="https://kongwiki.me/"><img src="https://avatars0.githubusercontent.com/u/19886738?v=4?s=100" width="100px;" alt=""/><br /><sub><b>weikunkun</b></sub></a><br /><a href="https://github.com/jxnu-liguobin/cs-summary-reflection/commits?author=KongWiki" title="Code">💻</a></td>
</tr>
</table>
......
# 算法-Java
1. 格式参考 **输出二叉树中所有从根到叶子的路径**
2. 提交前务必执行 **gradle -s spotlessApply** 格式化代码(只处理JVM语言,Java格式使用googleJavaFormat)
3. Java 8 以上,14以下
4. 下面列举的不完整,只是最新的
1. 提交前务必执行 **gradle -s spotlessApply** 格式化代码(只处理JVM语言,Java格式使用googleJavaFormat)
2. Java 8 以上,14以下
## author
......@@ -13,3 +11,5 @@
[poorguy](./src/main/java/io/github/poorguy/poorguy.md)
[wkk](./src/main/java/io/github/wkk/wkk.md)
/* All Contributors (C) 2020 */
package io.github.wkk;
/**
* @Time: 2020/7/30上午9:18
* @Author: kongwiki
* @Email: kongwiki@163.com
*/
public class TwoSum {
}
/** @Time: 2020/7/30上午9:18 @Author: kongwiki @Email: kongwiki@163.com */
public class TwoSum {}
/* All Contributors (C) 2020 */
package io.github.wkk.everyday.junly;
/**
* @Time: 2020/7/30上午8:52
* @Author: kongwiki
* @Email: kongwiki@163.com
*/
/** @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){
if (n <= division) {
if (n <= 2) {
return 1;
}else {
} 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;
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;
}
}
}
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册