hashtable

问题 int[] buildCharFreqTable(string phrase){ int[] tab = new int[Character.getNumericValue('z') - Character.getNumericValue('a') + 1]; for (char c : phrase.toCharArray()) { int x = getCharNumber(c); if ( x != -1){ tab[x]++; } } return tab; } This is a function that counts how many times each characters appear in a phrase. But I don't understand the line int[] tab = new int[Character.getNumericValue('z') - Character.getNumericValue('a') + 1]; What does this line do and why do we have to use

问题 int[] buildCharFreqTable(string phrase){ int[] tab = new int[Character.getNumericValue('z') - Character.getNumericValue('a') + 1]; for (char c : phrase.toCharArray()) { int x = getCharNumber(c); if ( x != -1){ tab[x]++; } } return tab; } This is a function that counts how many times each characters appear in a phrase. But I don't understand the line int[] tab = new int[Character.getNumericValue('z') - Character.getNumericValue('a') + 1]; What does this line do and why do we have to use

问题 I'm making a connect 4 AI in python, and I'm using minimax with iterative deepening and alpha beta pruning for this. For greater depths it's still quite slow, so I wanted to implement a transposition table. After reading up on it I think i get the general idea but i haven't been able to quite make it work. Here's part of my code: (the maximizing part of the minimax): if(isMaximizing): maxEval = -99999999999 bestMove = None # cache.get(hash(board)) Here's where i'd check to see if the hash is

问题 I'm making a connect 4 AI in python, and I'm using minimax with iterative deepening and alpha beta pruning for this. For greater depths it's still quite slow, so I wanted to implement a transposition table. After reading up on it I think i get the general idea but i haven't been able to quite make it work. Here's part of my code: (the maximizing part of the minimax): if(isMaximizing): maxEval = -99999999999 bestMove = None # cache.get(hash(board)) Here's where i'd check to see if the hash is

问题 I solved the first part of the question but stuck at the second part. I have an elevator and want to support the following: Init() Set the elevator to start from floor 0 and its travel direction to be up (This function is called only once and the direction can't be changed). O(1) AddStop(K) save into the DS that elevator should stop when it reaches floor k. O(log n) while n is the total number of stops for the elevator. NextStop() send the elevator to its next stop position, if it's in the

问题 As follow-up, suggested by Doug, on my previous question on anonymizing file ( PowerShell - Find and replace multiple patterns to anonymize file) I need to save all hash tables values in single file "tmp.txt" for further processing. Example: after processing the input file with string like: <requestId>>qwerty-qwer12-qwer56</requestId> the tmp.txt file contains: qwerty-qwer12-qwer56 : RequestId-1 and this is perfect. The problem is when working with many strings, in the tmp.txt file there are

问题 I get a stack overflow error due to my recursion creating an infinite loop. Turning the method into an iteration would stop this, but I have no idea how! Can anyone guide me in turning my recursion into a loop? private int findEmpty(int startPos, int stepNum, String key) { if (arr[startPos] == null) { return startPos; } return findEmpty(getNextLocation(startPos, ++stepNum, key), stepNum, key); } It is specifically return findEmpty(getNextLocation(startPos, ++stepNum, key), stepNum, key); that

问题 I get a stack overflow error due to my recursion creating an infinite loop. Turning the method into an iteration would stop this, but I have no idea how! Can anyone guide me in turning my recursion into a loop? private int findEmpty(int startPos, int stepNum, String key) { if (arr[startPos] == null) { return startPos; } return findEmpty(getNextLocation(startPos, ++stepNum, key), stepNum, key); } It is specifically return findEmpty(getNextLocation(startPos, ++stepNum, key), stepNum, key); that

问题 I've spent some time doing this, taking effort to put understandable variables and stuff. Tried to make it look clean and tidied up. So that I can easily debug it. But I can't seem to find my issue... The terminal doesn't output anything. Please help me identify my mistake! #include <limits.h> #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct list_node *node_ptr; struct list_node { node_ptr next; char *key; char *value; }; typedef node_ptr LIST; typedef node_ptr

问题 I need an associative data structure with floating point keys in which keys with nearly equal values are binned together. I'm working in C++ but language doesnt really matter. Basically my current strategy is to only handle single precision floating point numbers use an unordered_map with a custom key type define the hash function on the key type as a. given float v divide v by some tolerance, such as 0.0005, at double precision, yielding k . b. cast k to a 64 bit integer yielding ki c.