anagram

问题 I've written the following method to find out whether a long word contains a shorter word, and the order in which I pass the letters appears to effect the outcome. I've noticed that if I feed it absconds and bassy it correctly reports NO , but if I alphabetize the letters and give it abcdnoss and abssy , it gives YES . I'm not too sure why this is – can anyone spot the issue? - (BOOL) does: (NSString* ) longWord contain: (NSString *) shortWord { while([longWord length] > 0 && [shortWord

问题 In an effort to accelerate fast-out behaviour on testing strings for anagrams, I came up with a prime-based hashing scheme -- although it looks like I wasn't the first. The basic idea is to map letters to prime numbers, and to compute the product of these primes. Any rearrangement of the letters will have the same product, and if the result can be arbitrarily large then no combination of other letters can produce the same result. I had initially envisioned this as just a hash. Eventually the

问题 I've got a piece of code here that checks anagrams of a long list of words. I'm trying to find out how to search through every word in my long word list to find other anagrams that can match this word. Some words should have more than one anagram in my word list, yet I'm unable to find a solution to join the anagrams found in my list. set(['biennials', 'fawn', 'unsupportable', 'jinrikishas', 'nunnery', 'deferment', 'surlinesss', 'sonja', 'bioko', 'devon'] ect... Since I've been using sets,

问题 I am in the middle of building my anagram query which is almost working great. Here is my sql The letters I am using are "settin?" The difference is the wildcard which I will allow the user to add a "?" into the field. SELECT `word`, 0+ABS(`e`-1)+ABS(`i`-1)+ABS(`n`-1)+ABS(`s`-1)+ABS(`t`-2) AS difference FROM `TWL06` WHERE LENGTH(`word`) <= 7 HAVING difference <= 1 My Table Structure is as word | a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y

问题 I have created an anagram program that takes all words from a file and prints the letters followed by all of the words from the file that can be created using those letters. This is an example of what it prints out: cinos ['cions', 'coins', 'icons', 'scion', 'sonic'] Now that I have created an anagram program that has a dictionary with the random letters as keys and the anagrams as values, I want to find the group of letters(keys) that has the largest amount of anagrams(values) and print just

问题 Im trying to find all the possible anagrams of a string and store them in an array using only recursion. Im stuck and this is all i have. int main() { const int MAX = 10; string a = "ABCD"; string arr[10]; permute(arr, a, 0, a.size(), 0); return 0; } void permute(string arr[], string wrd, int firstLetter, int lastLetter, int it) { if (firstLetter == lastLetter) *arr = wrd; else { swap(wrd[firstLetter], wrd[it]); permute(arr, wrd, firstLetter + 1, lastLetter, it++); } } The order doesnt matter

问题 Alright so for class we have this problem where we need to be able to input a word and from a given text file (wordlist.txt) a list will be made using any anagrams of that word found in the file. My code so far looks like this: def find_anagrams1(string): """Takes a string and returns a list of anagrams for that string from the wordlist.txt file. string -> list""" anagrams = [] file = open("wordlist.txt") next = file.readline() while next != "": isit = is_anagram(string, next) if isit is True

问题 With much assistance I have developed a method that makes anagrams and then adds them into an ArrayList . public void f(String s, String anagram, ArrayList<String> array) { if(s.length() == 0) { array.add(anagram); return; } for(int i = 0 ; i < s.length() ; i++) { char l = s.charAt(i); anagram = anagram + l; s = s.substring(0, i) + s.substring(i+l, s.length()); f(s,anagram,array); } } The problem is when I attempt to use this function to make ArrayList s in a loop that adds String s from one

问题 Basically I have a problem with 2 subquestions. First question is: Given 2 strings, determine if they are anagrams. Second is a bit harder. You have N strings and have to determine if those are anagrams of each other. I've solved the first one and I'll write the code below, but for the second one I have no idea. I was thinking it's possible to somehow do it by reading N strings from an array of strings, and then to use a for sequence to read each of them and compare them but I have no idea

问题 I wrote a C function that checks if two given strings (C-style) are anagrams or not. I try to verify it with Frama-C but it cannot validate the final behaviors of the function (other specifications are valid). The first one goes to timeout (even with very high timeout values in WP) and the second is unknown. Here is the code: #include <string.h> //@ ghost char alphabet[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x'