Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with java
Search options not deleted
user 45932
Java (not to be confused with JavaScript) is a class-based, object-oriented, strongly typed, reflective language and run-time environment (JRE). Java programs are compiled to bytecode and run in a virtual machine (JVM) enabling a "write once, run anywhere" (WORA) methodology.
1
vote
Base adder, given base and two numbers of that base, it adds them
Why do you need to put the final in front of the StringBuilder.
Why didn't you assign the initial buffer size to the string builder
Why didn't you cache the value used for checking if a single charac …
- 191
1
vote
M coloring problem
The most blatant error is running time analysis is wrong.
Running time is T(E,V,M) with E,V, M as you said above.
Since you call compute() recursively, in the best case scenario the number of nodes b …
- 191
7
votes
1
answer
19k
views
Parsing arithmetic expressions like (x + y * a + b *z)
I have this code which I wrote to parse arithmetic expressions.
However, many people say there are problems with it but don't tell me what the problem is. Please let me know if you see any.
Note tha …
- 191