StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
5895114
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-05-05T09:02:14.093
FavoriteCount
0
LastActivityDate
2011-05-05T09:02:14.093
LastEditDate
LastEditorUserId
0
OwnerUserId
162684
ParentId
5890087
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
You can also search a word with O(n) complexity provided that you build an appropriate internal data structure from your <code>List<List<String>></code>. Here's an example: <pre><code>public class SO5890087 { Map<Character, List<Position>> pmaps = new HashMap<Character, List<Position>>(); public static void main(String[] args) { String[][] strings = new String[][] { { "r", "x", "f", "b", "e", "a", "r" }, { "a", "r", "q", "b", "o", "y", "t" }, { "s", "q", "z", "b", "s", "b", "r" } }; List<List<String>> sss = new ArrayList<List<String>>(); for (int i = 0; i < strings.length; i++) sss.add(new ArrayList<String>(Arrays.asList(strings[i]))); SO5890087 finder = new SO5890087(sss); List<Position> positions = finder.findWord("bob"); for (Position position : positions) System.out.println(position); } public SO5890087(List<List<String>> sss) { for (int i = 0; i < sss.size(); i++) { List<String> ss = sss.get(i); for (int j = 0; j < ss.size(); j++) { Character c = ss.get(j).charAt(0); if (! pmaps.containsKey(c)) pmaps.put(c, new ArrayList<Position>()); pmaps.get(c).add(new Position(i, j)); } } } public List<Position> findWord(String word) { List<Position> result = new ArrayList<Position>(); char[] cs = word.toCharArray(); for (int i = 0; i < cs.length; i++) { if (pmaps.containsKey(cs[i])) { result.add(pmaps.get(cs[i]).get(0)); } else { result.clear(); break; } } return result; } class Position { int list; int index; public Position(int list, int index) { this.list = list; this.index = index; } public int getList() { return list; } public int getIndex() { return index; } @Override public String toString() { return "Position [list=" + list + ", index=" + index + "]"; } } } </code></pre> Output for <code>"bob"</code>: <pre><code>Position [list=0, index=3] Position [list=1, index=4] Position [list=0, index=3] </code></pre> Notes: <ul> <li>a <code>Position</code> object identify a <code>list</code> and an <code>index</code> in that list</li> <li>at construction time I build a <code>Map</code> where keys are characters, and values are list of <code>Position</code> objects, each telling me in which list an and which index in that list I can find that character</li> <li>when finding a word, I simply scan the word characters and retrieve the first available <code>Position</code> for that character in my <code>Map</code></li> <li>you can easily modify the <code>findWord</code> method to return all possible combinations</li> <li>you can easily add method to update the internal <code>Map</code> with additional string in an existing list, or with new lists</li> <li>complexity: initialization is O(n^2) (must scan the list of lists of strings); finding a word is O(n)</li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POJava word search algorithm
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USMarcoS
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.