字典数据结构 [英] Dictionary Data Structure

问题描述

我想实现一个具有以下功能的字典数据结构

功能

* autocorrect

* autocomplete

*拼写检查


任何人都可以告诉我哪种数据结构最适合用于C / C ++的实现




Thanx in adv。

I want to implement a dictionary data structure with the features
features
* autocorrect
* autocomplete
* spellcheck

can any body tell me that which data structure will be best for its
implementation in C/C++

Thanx in adv.

推荐答案

我想起哈希表或尝试


但是他们所需的空间非常大

I think of Hash Table or Tries

but the space required by them will be very large

ravi写道：

ravi wrote:

我想实现一个具有以下功能的字典数据结构

功能

*自动更正

*自动完成

*拼写检查


任何人都可以告诉我哪种数据结构最适合用于C / C ++的实现

I want to implement a dictionary data structure with the features
features
* autocorrect
* autocomplete
* spellcheck

can any body tell me that which data structure will be best for its
implementation in C/C++

您使用哪种语言？答案各有不同。


-

Ian Collins。

Which language are you using? The answer will be different for each.

--
Ian Collins.

8月18，下午12:15，Ian Collins< ian-n ... @ hotmail.comwrote：

On Aug 18, 12:15 pm, Ian Collins <[e-mail]:

ravi写道：

ravi wrote:

我想实现一个具有以下功能的字典数据结构

功能

*自动更正

* autocomplete

*拼写检查

I want to implement a dictionary data structure with the features
features
* autocorrect
* autocomplete
* spellcheck

任何机构都可以告诉我哪种数据结构最适合其实施
在C / C ++

can any body tell me that which data structure will be best for its
implementation in C/C++

您使用的是哪种语言？答案各有不同。


-

Ian Collins。

Which language are you using? The answer will be different for each.

--
Ian Collins.

C / C ++

C/C++

这篇关于字典数据结构的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！