Commit Graph

8 Commits

Author SHA1 Message Date
github-actions
5d59a2e828 Formatted with Google Java Formatter 2020-10-24 10:23:28 +00:00
Hassan
4f45c5a479 Fixing packages. 2020-01-28 18:18:15 +02:00
shellhub
bb9e082aa9 update StackOfLinkedList 2019-10-18 17:47:04 +08:00
yanglbme
29948363da docs: update the whole repository
* fix some bugs
* delete duplicate files
* format code
2019-05-09 19:32:54 +08:00
yanglbme
2ea534000b
Update StackOfLinkedList.java 2019-03-05 10:18:20 +08:00
Ojas Saxena
d60f836861
Updated StackOfLinkedList.java
I made the code shorter and less prone to mistakes by removing the "size" variable altogether from the LinkedList class. I found that after each push/pop operation, changing the value of size did make the code more efficient, but made it more prone to mistakes. So, for empty stack, a simple "head == null" was enough, which has been incorporated.
2019-03-04 15:05:15 +05:30
Christian Bender
c86ba856a8 removed duplciated data-structures 2018-07-25 16:37:10 +02:00
khalil2535
82ef795675 Remove space from Data Structures package name 2018-04-14 06:45:48 +03:00