Discover java data structures video tutorials, include the articles, news, trends, analysis and practical advice about java data structures video tutorials on alibabacloud.com
only inherit one parent classPolymorphicFour, algorithm effectiveness analysis:4.1 Time Complexity: Https://baike.baidu.com/item/%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/1894057?fr=aladdin (Baidu Connection) F (N) =n! (factorial) n-times with a time complexity of n4.2 Space Complexity: Https://baike.baidu.com/item/%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/9664257?fr=aladdin (Baidu Connection)V. Abstract classTo include one or more abstract methods (without a method body): To implement
Stackelement see the implementation of the stackPackage Com.lip.datastruture.stack;public class QueueOperation Result:Implementation of the queue of data structures (JAVA)
' (', directly into the stack, if ') ', out of the stack and sequential output operator until the first ' (', the first encountered ' ('), but not the output, if the arithmetic character, the top element of the stack and the current element precedence: If the top of the stack operator precedence >= the current element priority , out of the stack and sequential output operator until the top element of the stack priority 5, repeat the 3rd until the expression scan is complete.6, sequentially out
public int getheight () {if (this==null) return 0;if (This.leftnode = = NULL This.rightnode = = null) retu RN 1;int lheight = This.leftNode.getHeight (); int rheight = This.rightNode.getHeight (); return lheight > Rheight? Lheight + 1:rheight + 1;}4. Layer k of the print tree (recursive implementation)Principle: Can be understood as the print root of the K-layer, that is, print the root of the child's k-1 layer, when k=0, can be directly printed outPrint the level layer of a tree public void P
methods of collection and traversal mode Collection:add () Remove () contains () iterator () size () Traversal: Enhanced for iterator |--listget () Traversal: normal For|--setmap:put () Remove () ContainsKey (), Containsvalue () KeySet () get () value () EntrySet () size () Traversal: Find values based on key values for key and value jobs: Any collection I've explained, I ask you to store what you are able to store. And, you have to be able to traverse it.4:arraylist,linkedlist,hashset,hashmap
)
Unordered array Delete (query + fill hole)
O (N)
Ordered array deletion (query + fill hole)
O (N)
Why not use data to solve everythingAn unordered array is inserted (O (1) time), and the query spends (O (N) time). An ordered array query spends (O (logn) time), but inserts a missing cost (O (N) time). And the deletion takes (O (N) time). So a data structur
is true. is called a short-circuit operation because if the value of the expression on the left side of is false, the expression on the right will be shorted out directly and will not be evaluated.Most of the time we may need to use instead of , for example, to verify that the user's name is not NULL and is not an empty string when validating the login, it should be written as username! = null !username.equals (""), The order of the two cannot be exchanged,You cannot use the operator, becaus
initialization does not require allocating space, but it needs to allocate a pointer field, there is a structural overhead, but there is no length limit.
Application recommendations:?? If the use of the stack element changes unpredictable, sometimes very small, sometimes very large, then it is best to use the chain stack, conversely, if its change in the controllable range, it is recommended to use a sequential stack is better.The reason for using the stack: the introduction of the stack s
Common data Structures in JavaCommon data structures are hash tables, linear lists, linked lists, and java.util packages with three important interfaces: List,set,map commonly used to implement basic data structuresHow the HashMap worksHashMap based on the hashing principle,
more additions and deletions: LinkedList104 query MORE: ArrayList the I don't know, just use ArrayList.106 I don't know, just use ArrayList.107 108 3: Common methods of collection and Traverse mode 109 Collection: the Add ()111 Remove () the contains ()113 iterator () the size () the the Traversal: 117 Enhanced for118 iterators119 -|--List121 get ()122 123 Traversal:124 General for the|--Set126 127 Map: - put ()129 Remove () the Con
Stack implementation of data structures (JAVA) (I)
// Stack top element public class StackElement
{Private StackElement
NextElement; private T data; public StackElement (T data) {this. data =
("Lookup data does not exist"); the return NULL; the } + -System.out.println ("Find successful, data is:" + This. list[p]); the return This. list[p];Bayi } the the //Sequential Table Size - Public intSizeOf () { - return This. Listlen; the } the the Public voidPrint () { theSystem.out.print ("["); - for(inti = 0; I This. list.length;
, this time will not be faster than bubble sorting.Back to top 4, summaryThe above three kinds of sorting, bubbling, selecting, inserting with large O notation all require O (N2) time level. Bubbling sorting is not generally selected, although bubbling sort writing is the simplest, but the average performance is not to choose sort and insert sort well.Select sort to reduce the number of exchanges to the lowest, but the number of comparisons is quite large. Select sort can be applied when the amo
with large O notation all require O (N2) time level. Bubbling sorting is not generally selected, although bubbling sort writing is the simplest, but the average performance is not to choose sort and insert sort well.Select sort to reduce the number of exchanges to the lowest, but the number of comparisons is quite large. Select sort can be applied when the amount of data is small and exchange data is more
This article summarizes some of the data structures implemented in JavaBriefly:ListQueuemapSetThe data structure involved:Stack: provides push and stack (POP) functionsqueues: non-blocking methods for offer and pull, blocking methods for put and takeList : provides various functions such as add, find, remove, traverse, etc.Tree: Red-black tree, usually used for r
;importorg.junit.before;importorg.junit.test; importcom.xingej.algorithm.datastructure.array.myarray;/*** Object-Oriented programming,** That is, the you operate is an object, not a basic data type *** @author erjun2017 November 28 Afternoon 9:59:36*/publicclassmyarraytest{privatemyarray myarray; @Before publicvoidinit () { myarray=newmyarray (); testinsert ();}// Insert data test @Test publicvoidtest (
Stacks and queues:It is generally used as a programmer's tool to assist the idea algorithm, the life cycle is shorter, the runtime is created;Access is restricted, at a particular time, only one data can be read or deleted;is an abstract structure, the internal implementation mechanism, not visible to users, such as the use of arrays, linked lists to implement the stack.
Analog stack structureat the same time, only one
starts with two pointers, and two pointers point to both ends of the array. (The word "pointer" is used here to indicate the array data item, not the pointer in C + +.) The pointer on the left, Leftptr, moves to the right, while the pointer on the right, rightptr, moves to the left.In fact, leftptr initialization is at the left of the first data item, and Rightptr is on the right-hand side of the last
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.