Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Snowleopard_wu
Java
提交
dd3b2d2a
J
Java
项目概览
Snowleopard_wu
/
Java
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
J
Java
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
dd3b2d2a
编写于
8月 25, 2020
作者:
A
Abhijay Kumar
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fixed code smells detected by SonarQube - PR#1429
https://github.com/TheAlgorithms/Java/pull/1429
上级
32b02af2
变更
18
隐藏空白更改
内联
并排
Showing
18 changed file
with
53 addition
and
50 deletion
+53
-50
src/main/java/com/caching/LFUCache.java
src/main/java/com/caching/LFUCache.java
+4
-4
src/main/java/com/caching/LRUCache.java
src/main/java/com/caching/LRUCache.java
+0
-1
src/main/java/com/ciphers/CaesarBruteForce.java
src/main/java/com/ciphers/CaesarBruteForce.java
+6
-6
src/main/java/com/conversions/HexadecimalToBinary.java
src/main/java/com/conversions/HexadecimalToBinary.java
+3
-3
src/main/java/com/datastructures/BinaryTree.java
src/main/java/com/datastructures/BinaryTree.java
+22
-19
src/main/java/com/datastructures/DisjointSet.java
src/main/java/com/datastructures/DisjointSet.java
+6
-5
src/main/java/com/datastructures/GeneralQueue.java
src/main/java/com/datastructures/GeneralQueue.java
+1
-1
src/main/java/com/datastructures/IntQueue.java
src/main/java/com/datastructures/IntQueue.java
+1
-1
src/main/java/com/datastructures/SinglyLinkedList.java
src/main/java/com/datastructures/SinglyLinkedList.java
+1
-1
src/main/java/com/datastructures/Stack.java
src/main/java/com/datastructures/Stack.java
+1
-1
src/main/java/com/matchings/stablematching/GaleShapley.java
src/main/java/com/matchings/stablematching/GaleShapley.java
+1
-1
src/test/java/com/datastructures/BinaryTreeTest.java
src/test/java/com/datastructures/BinaryTreeTest.java
+1
-1
src/test/java/com/datastructures/DisjointSetTest.java
src/test/java/com/datastructures/DisjointSetTest.java
+1
-1
src/test/java/com/datastructures/GeneralQueueTest.java
src/test/java/com/datastructures/GeneralQueueTest.java
+1
-1
src/test/java/com/datastructures/IntQueueTest.java
src/test/java/com/datastructures/IntQueueTest.java
+1
-1
src/test/java/com/datastructures/SinglyLinkedListTest.java
src/test/java/com/datastructures/SinglyLinkedListTest.java
+1
-1
src/test/java/com/datastructures/StackTest.java
src/test/java/com/datastructures/StackTest.java
+1
-1
src/test/java/com/matchings/stablematching/GaleShapleyTest.java
...st/java/com/matchings/stablematching/GaleShapleyTest.java
+1
-1
未找到文件。
src/main/java/com/caching/LFUCache.java
浏览文件 @
dd3b2d2a
...
...
@@ -75,8 +75,8 @@ class LFUCache<T> {
public
LFUCache
(
int
capacity
)
{
this
.
capacity
=
capacity
;
size
=
0
;
freq
=
new
TreeMap
<
Integer
,
DLL
>();
map
=
new
HashMap
<
Integer
,
Node
>();
freq
=
new
TreeMap
<>();
map
=
new
HashMap
<>();
System
.
out
.
println
(
"LFUCache initialised with capacity: "
+
capacity
);
}
...
...
@@ -145,8 +145,8 @@ class LFUCache<T> {
dll
.
deleteNode
(
dll
.
tail
.
pre
);
if
(
dll
.
len
==
0
&&
lowest
!=
1
)
freq
.
remove
(
lowest
);
DLL
freq
_o
ne
=
freq
.
computeIfAbsent
(
1
,
k
->
new
DLL
());
freq
_o
ne
.
addToHead
(
node
);
DLL
freq
O
ne
=
freq
.
computeIfAbsent
(
1
,
k
->
new
DLL
());
freq
O
ne
.
addToHead
(
node
);
}
}
...
...
src/main/java/com/caching/LRUCache.java
浏览文件 @
dd3b2d2a
...
...
@@ -63,7 +63,6 @@ public class LRUCache<T> {
System
.
out
.
println
(
"Cache set to 0 capacity. No elements will be cached"
);
}
T
currentValue
=
cache
.
get
(
key
);
if
(!
cache
.
containsKey
(
key
))
{
cache
.
put
(
key
,
value
);
System
.
out
.
println
(
"Adding new key:"
+
key
+
" to cache"
);
...
...
src/main/java/com/ciphers/CaesarBruteForce.java
浏览文件 @
dd3b2d2a
...
...
@@ -5,25 +5,25 @@ public class CaesarBruteForce {
/**
* Recursively Brute forces a parsed encrypted text, trying out all shifting keys from 1-26, printing out all decryption attempts
* @param message (String) The encrypted text.
* @param
K
ey (int) The key used to decrypt the encrypted text and is increment upon a recursive call.
* @param
k
ey (int) The key used to decrypt the encrypted text and is increment upon a recursive call.
* @return (String) Concatenated string of all decryption attempts (For unit testing purposes).
*/
public
String
decrypt
(
String
message
,
int
K
ey
)
{
public
String
decrypt
(
String
message
,
int
k
ey
)
{
final
String
LETTERS
=
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
;
if
(
K
ey
>
26
){
System
.
out
.
println
();
return
null
;
}
if
(
k
ey
>
26
){
System
.
out
.
println
();
return
null
;
}
StringBuilder
plainText
=
new
StringBuilder
();
for
(
char
character
:
message
.
toUpperCase
().
toCharArray
())
{
int
index
=
LETTERS
.
indexOf
(
character
);
if
(
index
!=
-
1
)
{
index
-=
K
ey
;
index
-=
k
ey
;
//Wrap around index value range[1-26]
if
(
index
<
0
)
{
index
+=
LETTERS
.
length
();
}
plainText
.
append
(
LETTERS
.
toCharArray
()[
index
]);
}
else
{
plainText
.
append
(
character
);
}
}
System
.
out
.
println
(
String
.
format
(
"Current Decryption Key %d : %s"
,
K
ey
,
plainText
));
return
plainText
.
append
(
decrypt
(
message
,
K
ey
+
1
)).
toString
();
System
.
out
.
println
(
String
.
format
(
"Current Decryption Key %d : %s"
,
k
ey
,
plainText
));
return
plainText
.
append
(
decrypt
(
message
,
k
ey
+
1
)).
toString
();
}
}
src/main/java/com/conversions/HexadecimalToBinary.java
浏览文件 @
dd3b2d2a
...
...
@@ -12,7 +12,7 @@ public class HexadecimalToBinary {
public
String
hexToBin
(
String
hexStr
)
{
String
binaryString
=
""
,
hexaNumbers
=
"0123456789ABCDEF"
,
D
ecimalStr
=
""
,
binaryStringBefore
=
""
,
binaryStringAfter
=
""
;
d
ecimalStr
=
""
,
binaryStringBefore
=
""
,
binaryStringAfter
=
""
;
int
indexOfHex
,
decimalNumber
=
0
,
k
=
1
,
n
=
1
,
z
=
1
,
decimalNumberBefore
=
0
,
decimalNumberAfter
=
0
;
char
letter
;
...
...
@@ -48,12 +48,12 @@ public class HexadecimalToBinary {
String
decimalNumberAfterStr
=
String
.
valueOf
(
decimalNumberAfter
);
D
ecimalStr
=
decimalNumberBeforeStr
+
'.'
+
decimalNumberAfterStr
;
d
ecimalStr
=
decimalNumberBeforeStr
+
'.'
+
decimalNumberAfterStr
;
}
int
pointPositionDec
=
D
ecimalStr
.
indexOf
(
"."
);
int
pointPositionDec
=
d
ecimalStr
.
indexOf
(
"."
);
/**
* Check whether the result contains a floating point or not
*/
...
...
src/main/java/com/datastructures/BinaryTree.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
/**
* Binary tree for general value type, without redundancy
...
...
@@ -8,7 +8,7 @@ package com.dataStructures;
public
class
BinaryTree
<
T
extends
Comparable
>
{
private
final
T
data
;
private
BinaryTree
right
,
// the upper binary tree
private
BinaryTree
<
T
>
right
,
// the upper binary tree
left
;
// the lower binary tree
public
BinaryTree
(
T
data
)
{
...
...
@@ -21,35 +21,38 @@ public class BinaryTree<T extends Comparable> {
}
/**
* inserts a new value in it's correspond
a
nt place
* inserts a new value in it's correspond
e
nt place
*
* @param newDataValue value of the new binary tree to add on this tree
*/
public
void
insert
(
T
newDataValue
)
{
this
.
insert
(
new
BinaryTree
(
newDataValue
));
this
.
insert
(
new
BinaryTree
<>
(
newDataValue
));
}
/**
* inserts a new binary tree in it's correspond
a
nt place
* inserts a new binary tree in it's correspond
e
nt place
*
* @param newData new value to add on this tree
*/
public
void
insert
(
BinaryTree
newData
)
{
public
void
insert
(
BinaryTree
<
T
>
newData
)
{
int
cpr
=
newData
.
data
.
compareTo
(
this
.
data
);
//new value comparission respect to actual value
if
(
cpr
<
0
)
if
(
this
.
left
==
null
)
if
(
cpr
<
0
)
{
if
(
this
.
left
==
null
)
{
this
.
setLeft
(
newData
);
else
}
else
{
this
.
left
.
insert
(
newData
);
else
if
(
cpr
>
0
)
if
(
this
.
right
==
null
)
}
}
else
if
(
cpr
>
0
)
{
if
(
this
.
right
==
null
)
{
this
.
setRight
(
newData
);
else
}
else
{
this
.
right
.
insert
(
newData
);
else
}
}
else
{
System
.
out
.
println
(
"Redundant value, not added"
);
}
}
/**
...
...
@@ -58,8 +61,8 @@ public class BinaryTree<T extends Comparable> {
* @param data Searched value
* @return Binary tree which contains the value, null if it doesn't exist
*/
public
BinaryTree
search
(
T
data
)
{
int
cpr
=
data
.
compareTo
(
this
.
data
);
//new value comparis
si
on respect to actual value
public
BinaryTree
<
T
>
search
(
T
data
)
{
int
cpr
=
data
.
compareTo
(
this
.
data
);
//new value comparison respect to actual value
if
(
cpr
<
0
)
{
if
(
this
.
left
==
null
)
...
...
@@ -113,19 +116,19 @@ public class BinaryTree<T extends Comparable> {
return
data
;
}
public
BinaryTree
getRight
()
{
public
BinaryTree
<
T
>
getRight
()
{
return
right
;
}
public
void
setRight
(
BinaryTree
right
)
{
public
void
setRight
(
BinaryTree
<
T
>
right
)
{
this
.
right
=
right
;
}
public
BinaryTree
getLeft
()
{
public
BinaryTree
<
T
>
getLeft
()
{
return
left
;
}
public
void
setLeft
(
BinaryTree
left
)
{
public
void
setLeft
(
BinaryTree
<
T
>
left
)
{
this
.
left
=
left
;
}
}
src/main/java/com/datastructures/DisjointSet.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
java.io.Serializable
;
import
java.util.*
;
...
...
@@ -18,14 +18,15 @@ import java.util.*;
*/
public
class
DisjointSet
<
T
>
implements
Serializable
{
private
static
final
long
serialVersionUID
=
3134700471905625636L
;
private
static
final
String
elementKey
=
"element"
;
private
Map
<
T
,
Node
<
T
>>
nodeMap
=
new
HashMap
<>();
private
final
Map
<
T
,
Node
<
T
>>
nodeMap
=
new
HashMap
<>();
/**
* Add an element to the disjoint-set forests as a set.
*/
public
void
makeSet
(
T
element
)
{
checkNotNull
(
element
,
"element"
);
checkNotNull
(
element
,
elementKey
);
nodeMap
.
putIfAbsent
(
element
,
new
Node
<>());
}
...
...
@@ -36,8 +37,8 @@ public class DisjointSet<T> implements Serializable {
* Rank is an upper bound on the height of node.
*/
public
void
union
(
T
left
,
T
right
)
{
checkNotNull
(
left
,
"element"
);
checkNotNull
(
right
,
"element"
);
checkNotNull
(
left
,
elementKey
);
checkNotNull
(
right
,
elementKey
);
Node
<
T
>
leftNode
=
nodeMap
.
get
(
left
),
rightNode
=
nodeMap
.
get
(
right
);
...
...
src/main/java/com/datastructures/GeneralQueue.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
com.types.Queue
;
...
...
src/main/java/com/datastructures/IntQueue.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
/**
* This file contains an implementation of an integer only queue which is extremely quick and
...
...
src/main/java/com/datastructures/SinglyLinkedList.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
...
...
src/main/java/com/datastructures/Stack.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
java.io.Serializable
;
import
java.util.EmptyStackException
;
...
...
src/main/java/com/matchings/stablematching/GaleShapley.java
浏览文件 @
dd3b2d2a
package
com.matchings.stable
M
atching
;
package
com.matchings.stable
m
atching
;
public
class
GaleShapley
{
...
...
src/test/java/com/datastructures/BinaryTreeTest.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
org.junit.jupiter.api.Assertions
;
import
org.junit.jupiter.api.Test
;
...
...
src/test/java/com/datastructures/DisjointSetTest.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
org.junit.jupiter.api.Assertions
;
import
org.junit.jupiter.api.Test
;
...
...
src/test/java/com/datastructures/GeneralQueueTest.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
com.types.Queue
;
...
...
src/test/java/com/datastructures/IntQueueTest.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
static
org
.
junit
.
Assert
.*;
...
...
src/test/java/com/datastructures/SinglyLinkedListTest.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
org.junit.Test
;
import
org.junit.jupiter.api.Assertions
;
...
...
src/test/java/com/datastructures/StackTest.java
浏览文件 @
dd3b2d2a
package
com.data
S
tructures
;
package
com.data
s
tructures
;
import
org.junit.jupiter.api.Assertions
;
import
org.junit.jupiter.api.Test
;
...
...
src/test/java/com/matchings/stablematching/GaleShapleyTest.java
浏览文件 @
dd3b2d2a
package
com.matchings.stable
M
atching
;
package
com.matchings.stable
m
atching
;
import
org.junit.jupiter.api.Assertions
;
import
org.junit.jupiter.api.Test
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录