大约有 17,000 项符合查询结果（耗时：0.0345秒） [XML]
When to use a linked list over an array/array list?
I use a lot of lists and arrays but I have yet to come across a scenario in which the array list couldn't be used just as easily as, if not easier than, the linked list. I was hoping someone could give me some examples of when the linked list is notably better.
...
Finding the max value of an attribute in an array of objects
I'm looking for a really quick, clean and efficient way to get the max "y" value in the following JSON slice:
13 Answers
...
When to use LinkedList over ArrayList in Java?
I've always been one to simply use:
33 Answers
33
...
What is pseudopolynomial time? How does it differ from polynomial time?
What is pseudopolynomial time ? How does it differ from polynomial time? Some algorithms that run in pseudopolynomial time have runtimes like O(nW) (for the 0/1 Knapsack Problem ) or O(√n) (for trial division ); why doesn't that count as polynomial time?
...
Best way to represent a fraction in Java?
I'm trying to work with fractions in Java.
26 Answers
26
...
How do I make a simple makefile for gcc on Linux?
I have three files: program.c , program.h and headers.h .
5 Answers
5
...
Why is inserting in the middle of a linked list O(1)?
According to the Wikipedia article on linked lists , inserting in the middle of a linked list is considered O(1). I would think it would be O(n). Wouldn't you need to locate the node which could be near the end of the list?
...
When is each sorting algorithm used? [closed]
What are the use cases when a particular sorting algorithm is preferred over others - merge sort vs QuickSort vs heapsort vs 'intro sort', etc?
...
Java List.contains(Object with field value equal to x)
I want to check whether a List contains an object that has a field with a certain value. Now, I could use a loop to go through and check, but I was curious if there was anything more code efficient.
...