anagram

问题 Which is the best way of generating anagrams for a text(maximum 80 characters length). Example: Input: dog output dog dgo odg ogd gdo god I'm only thinking of a backtracking solution, but that will take a while if the text is longer. Another thought is bulding i trie for all words in dictionary, but the problem doesn't ask for real words. Can somebody point out a minimum time complexity solution? Thank you! 回答1: The question looks like generating the list of permutations; (Anagrams are a

问题 What I'm trying to do is if I have a list like: ["lime", "mile", "liem", "tag", "gat", "goat", "math"] I want to write a function that returns the words in the list that have an anagram, which would look like: ["lime", "mile", "liem", "tag", "gat",] So far I have this code: def anagramprinter(x): output = [] for i in x: for n in i: if n in x[i]: I can't past this part and would like some help and would also appreciate a thorough explanation as well. Can anyone please show me a way that doesn

问题 My title got edited, so I wanted to make sure everyone knows this is homework. The problem is just to optimize the program, the hashing is my idea. -- I'm working on optimizing a C program that groups together words that are anagrams of each other, and then prints them out. Currently the program is basically a linked list of linked lists. Each link in the outer list is a group of words that are anagrams of each other. The profile for the program shows that by far, the largest portion of

问题 I have tried absolutely everything under the sun to figure this out and have gotten nothing. I'm not even sure how to approach the problem. The instructions are as follows... Your program will ask the user for the name of the file containing the list of words. The word list is formatted to have one word on each line. • For each word, find all anagrams (some have more than one) of that word. • Output: Report how many words have 0, 1, 2, etc., anagrams. Output the list of words that form the

问题 This is my code below to check anagram of a given string array. It always gives me false even in the simplest case with only one input. I don't understand am I not converting string array into string correctly or my algorithm is plain wrong. public class anagram { static boolean isAnagram(String[] s1, String[] s2) { String str = s1.toString(); String str2 = s2.toString(); if (str.length() != str2.length()) return false; for (int i =0; i<str.length();i++) { for (int j = 0;j<str2.length();j++)

问题 My anagram program works great in my dev-cpp but in any online tester throw wrong answer on any testing anagram. Can someone help me? #include<iostream> #include<cstring> using namespace std; int main() { char input1[10000]; char input2[10000]; cin >> input1; getchar(); cin >> input2; getchar(); int leng; leng = strlen(input1); bool output[leng]; for(int i=0; i<leng; i++){ for(int y=0; y<leng; y++){ if( input1[i] == input2[y] ){ output[i] = true; } } } for(int o=0; o<leng; o++ ){ if( (o+1) ==

问题 This question already has answers here : How to check if two words are anagrams (34 answers) Closed 6 years ago . Given array of words, group the anagrams IP:{tar,rat,banana,atr} OP:{[tar,rat,atr],[banana]} One solution to this question using Hash Table. consider each word, sort it and add as key to hash table if not present. The value for the key would be a list of all anagrams with the same key. I wanted to know about the time complexities, To sort the characters in an array, suppose O(n

问题 Given a string array， return all groups of strings that are anagrams. My solutions: For each string word in the array, sort it O(m lg m), m is the average length of a word. Build up a hash Table < string, list >. Put the sorted word into the hash table as key and also generate all permutations (O(m!)) of the word, search each permutation in a dictionary (a prefix tree map) with O(m), if it is in the dictionary, put (O(1)) it into the hash table so that all permutated words are put into the

问题 I have been searching the internet for awhile now for steps to find all the anagrams of a string (word) (i.e. Team produces the word tame) using a hashtable and a trie. All I have found here on SO is to verify 2 words are anagrams. I would like to take it a step further and find an algorithm in english so that I can program it in Java. For example, Loop through all the characters. For each unique character insert into the hashtable. and so forth. I don't want a complete program. Yes, I am

问题 I am trying to solve the following question: https://www.hackerrank.com/challenges/sherlock-and-anagrams This is my code import java.util.*; public class Solution { public static boolean check(String s1,String s2) { int [] count1 = new int[26]; for( int i = 0; i < s1.length(); i++ ) { char ch1 = s1.charAt(i); count1[ch1-'a']++; } int [] count2 = new int[26]; for( int i = 0; i < s2.length(); i++ ) { char ch2 = s2.charAt(i); count2[ch2-'a']++; } int count =0; for(int j=0;j<26;j++) { count =