iOS 數(shù)據(jù)結(jié)構(gòu)之鏈表

鏈表(Linked List)是一種物理存儲(chǔ)單元上非連續(xù)啸盏、非順序的存儲(chǔ)結(jié)構(gòu)硼瓣,數(shù)據(jù)元素的邏輯順序是通過鏈表中的指針鏈接次序?qū)崿F(xiàn)的,表現(xiàn)形式如下圖所示:

單鏈表

雙鏈表

數(shù)組和鏈表區(qū)別:

數(shù)組:數(shù)組元素在內(nèi)存上連續(xù)存放,可以通過下標(biāo)查找元素竣贪;插入、刪除需要移動(dòng)大量元素巩螃,比較適用于元素很少變化的情況

鏈表:鏈表中的元素在內(nèi)存中不是順序存儲(chǔ)的演怎,查找慢,插入避乏、刪除只需要對(duì)元素指針重新賦值爷耀,效率高

Objective-C 里沒有現(xiàn)成的鏈表結(jié)構(gòu),下面我實(shí)現(xiàn)了非線程安全的單鏈表和雙鏈表拍皮,以下都是具體的實(shí)現(xiàn)細(xì)節(jié)歹叮,完整代碼可以在這兒下載

單鏈表

單鏈表提供了插入、刪除铆帽、查詢咆耿、反轉(zhuǎn)等操作,具體實(shí)現(xiàn)如下:

BBSingleLinkedList.h

#import

@interface BBSingleLinkedNode : NSObject

@property (nonatomic, strong) NSString *key;

@property (nonatomic, strong) NSString *value;

@property (nonatomic, strong) BBSingleLinkedNode *next;

- (instancetype)initWithKey:(NSString *)key

value:(NSString *)value;

+ (instancetype)nodeWithKey:(NSString *)key

value:(NSString *)value;

@end

@interface BBSingleLinkedList : NSObject

- (void)insertNode:(BBSingleLinkedNode *)node;

- (void)insertNodeAtHead:(BBSingleLinkedNode *)node;

- (void)insertNode:(BBSingleLinkedNode *)newNode beforeNodeForKey:(NSString *)key;

- (void)insertNode:(BBSingleLinkedNode *)newNode afterNodeForKey:(NSString *)key;

- (void)bringNodeToHead:(BBSingleLinkedNode *)node;

- (void)removeNode:(BBSingleLinkedNode *)node;

- (BBSingleLinkedNode *)nodeForKey:(NSString *)key;

- (BBSingleLinkedNode *)headNode;

- (BBSingleLinkedNode *)lastNode;

- (NSInteger)length;

- (BOOL)isEmpty;

- (void)reverse;

- (void)readAllNode;

@end

BBSingleLinkedList.m

#import "BBSingleLinkedList.h"

@implementation BBSingleLinkedNode

- (instancetype)initWithKey:(NSString *)key

value:(NSString *)value

{

if (self = [super init]) {

_key = key;

_value = value;

}

return self;

}

+ (instancetype)nodeWithKey:(NSString *)key

value:(NSString *)value

{

return [[[self class] alloc] initWithKey:key value:value];

}

#pragma mark - NSCopying

- (id)copyWithZone:(nullable NSZone *)zone

{

BBSingleLinkedNode *newNode = [[BBSingleLinkedNode allocWithZone:zone] init];

newNode.key = self.key;

newNode.value = self.value;

newNode.next = self.next;

return newNode;

}

@end

@interface BBSingleLinkedList ()

@property (nonatomic, strong) BBSingleLinkedNode *headNode;

@property (nonatomic, strong) NSMutableDictionary *innerMap;

@end

@implementation BBSingleLinkedList

- (instancetype)init

{

self = [super init];

if (self) {

_innerMap = [NSMutableDictionary new];

}

return self;

}

#pragma mark - public

- (void)insertNodeAtHead:(BBSingleLinkedNode *)node

{

if (!node || node.key.length == 0) {

return;

}

if ([self isNodeExists:node]) {

return;

}

_innerMap[node.key] = node;

if (_headNode) {

node.next = _headNode;

_headNode = node;

} else {

_headNode = node;

}

}

- (void)insertNode:(BBSingleLinkedNode *)node

{

if (!node || node.key.length == 0) {

return;

}

if ([self isNodeExists:node]) {

return;

}

_innerMap[node.key] = node;

if (!_headNode) {

_headNode = node;

return;

}

BBSingleLinkedNode *lastNode = [self lastNode];

lastNode.next = node;

}

- (void)insertNode:(BBSingleLinkedNode *)newNode beforeNodeForKey:(NSString *)key

{

if (key.length == 0 || !newNode || newNode.key.length == 0) {

return;

}

if ([self isNodeExists:newNode]) {

return;

}

if (!_headNode) {

_headNode = newNode;

return;

}

BBSingleLinkedNode *node = _innerMap[key];

if (node) {

_innerMap[newNode.key] = newNode;

BBSingleLinkedNode *aheadNode = [self nodeBeforeNode:node];

if (aheadNode) {

aheadNode.next = newNode;

newNode.next = node;

} else {

_headNode = newNode;

newNode.next = node;

}

} else {

[self insertNode:newNode]; ?//insert to tail

}

}

- (void)insertNode:(BBSingleLinkedNode *)newNode afterNodeForKey:(NSString *)key

{

if (key.length == 0 || !newNode || newNode.key.length == 0) {

return;

}

if ([self isNodeExists:newNode]) {

return;

}

if (!_headNode) {

_headNode = newNode;

return;

}

BBSingleLinkedNode *node = _innerMap[key];

if (node) {

_innerMap[newNode.key] = newNode;

newNode.next = node.next;

node.next = newNode;

} else {

[self insertNode:newNode]; ?//insert to tail

}

}

- (void)removeNode:(BBSingleLinkedNode *)node

{

if (!node || node.key.length == 0) {

return;

}

[_innerMap removeObjectForKey:node.key];

if (node.next) {

node.key = node.next.key;

node.value = node.next.value;

node.next = node.next.next;

} else {

BBSingleLinkedNode *aheadNode = [self nodeBeforeNode:node];

aheadNode.next = nil;

}

}

- (void)bringNodeToHead:(BBSingleLinkedNode *)node

{

if (!node || !_headNode) {

return;

}

if ([node isEqual:_headNode]) {

return;

}

BBSingleLinkedNode *aheadNode = [self nodeBeforeNode:node];

aheadNode.next = node.next;

node.next = _headNode;

_headNode = node;

}

- (BBSingleLinkedNode *)nodeForKey:(NSString *)key

{

if (key.length == 0) {

return nil;

}

BBSingleLinkedNode *node = _innerMap[key];

return node;

}

- (BBSingleLinkedNode *)headNode

{

return _headNode;

}

- (BBSingleLinkedNode *)lastNode

{

BBSingleLinkedNode *last = _headNode;

while (last.next) {

last = last.next;

}

return last;

}

- (void)reverse

{

BBSingleLinkedNode *prev = nil;

BBSingleLinkedNode *current = _headNode;

BBSingleLinkedNode *next = nil;

while (current) {

next = current.next;

current.next = prev;

prev = current;

current = next;

}

_headNode = prev;

}

- (void)readAllNode

{

BBSingleLinkedNode *tmpNode = _headNode;

while (tmpNode) {

NSLog(@"node key -- %@, node value -- %@", tmpNode.key, tmpNode.value);

tmpNode = tmpNode.next;

}

}

- (NSInteger)length

{

NSInteger _len = 0;

for (BBSingleLinkedNode *node = _headNode; node; node = node.next) {

_len ++;

}

return _len;

}

- (BOOL)isEmpty

{

return _headNode == nil;

}

#pragma mark - private

- (BBSingleLinkedNode *)nodeBeforeNode:(BBSingleLinkedNode *)node

{

BBSingleLinkedNode *targetNode = nil;

BBSingleLinkedNode *tmpNode = _headNode;

while (tmpNode) {

if ([tmpNode.next isEqual:node]) {

targetNode = tmpNode;

break;

} else {

tmpNode = tmpNode.next;

}

}

return targetNode;

}

- (BOOL)isNodeExists:(BBSingleLinkedNode *)node

{

BBSingleLinkedNode *tmpNode = _headNode;

while (tmpNode) {

if ([tmpNode isEqual:node]) {

return YES;

}

tmpNode = tmpNode.next;

}

return false;

}

@end

雙鏈表

雙鏈表提供了插入爹橱、刪除萨螺、查詢操作,具體實(shí)現(xiàn)如下:

BBLinkedMap.h

#import

@interface BBLinkedNode : NSObject

@property (nonatomic, strong) NSString *key;

@property (nonatomic, strong) NSString *value;

@property (nonatomic, strong) BBLinkedNode *prev;

@property (nonatomic, strong) BBLinkedNode *next;

- (instancetype)initWithKey:(NSString *)key

value:(NSString *)value;

+ (instancetype)nodeWithKey:(NSString *)key

value:(NSString *)value;

@end

@interface BBLinkedMap : NSObject

- (void)insertNodeAtHead:(BBLinkedNode *)node;

- (void)insertNode:(BBLinkedNode *)node;

- (void)insertNode:(BBLinkedNode *)newNode beforeNodeForKey:(NSString *)key;

- (void)insertNode:(BBLinkedNode *)newNode afterNodeForKey:(NSString *)key;

- (void)bringNodeToHead:(BBLinkedNode *)node;

- (void)readAllNode;

- (void)removeNodeForKey:(NSString *)key;

- (void)removeTailNode;

- (NSInteger)length;

- (BOOL)isEmpty;

- (BBLinkedNode *)nodeForKey:(NSString *)key;

- (BBLinkedNode *)headNode;

- (BBLinkedNode *)tailNode;

@end

BBLinkedMap.m

#import "BBLinkedMap.h"

@implementation BBLinkedNode

- (instancetype)initWithKey:(NSString *)key

value:(NSString *)value

{

if (self = [super init]) {

_key = key;

_value = value;

}

return self;

}

+ (instancetype)nodeWithKey:(NSString *)key

value:(NSString *)value

{

return [[[self class] alloc] initWithKey:key value:value];

}

#pragma mark - NSCopying

- (id)copyWithZone:(nullable NSZone *)zone

{

BBLinkedNode *newNode = [[BBLinkedNode allocWithZone:zone] init];

newNode.key = self.key;

newNode.value = self.value;

newNode.prev = self.prev;

newNode.next = self.next;

return newNode;

}

@end

@interface BBLinkedMap ()

@property (nonatomic, strong) BBLinkedNode *headNode;

@property (nonatomic, strong) BBLinkedNode *tailNode;

@property (nonatomic, strong) NSMutableDictionary *innerMap;

@end

@implementation BBLinkedMap

- (instancetype)init

{

self = [super init];

if (self) {

_innerMap = [NSMutableDictionary new];

}

return self;

}

#pragma mark - public

- (void)insertNodeAtHead:(BBLinkedNode *)node

{

if (!node || node.key.length == 0) {

return;

}

if ([self isNodeExists:node]) {

return;

}

_innerMap[node.key] = node;

if (_headNode) {

node.next = _headNode;

_headNode.prev = node;

_headNode = node;

} else {

_headNode = _tailNode = node;

}

}

- (void)insertNode:(BBLinkedNode *)node

{

if (!node || node.key.length == 0) {

return;

}

if ([self isNodeExists:node]) {

return;

}

if (!_headNode && !_tailNode) {

_headNode = _tailNode = node;

return;

}

_innerMap[node.key] = node;

_tailNode.next = node;

node.prev = _tailNode;

_tailNode = node;

}

- (void)insertNode:(BBLinkedNode *)newNode beforeNodeForKey:(NSString *)key

{

if (key.length == 0 || !newNode || newNode.key.length == 0) {

return;

}

if ([self isNodeExists:newNode]) {

return;

}

if (!_headNode && !_tailNode) {

_headNode = _tailNode = newNode;

return;

}

BBLinkedNode *node = _innerMap[key];

if (node) {

_innerMap[newNode.key] = newNode;

if (node.prev) {

node.prev.next = newNode;

newNode.prev = node.prev;

} else {

_headNode = newNode;

}

node.prev = newNode;

newNode.next = node;

} else {

[self insertNode:newNode]; ?//insert to tail

}

}

- (void)insertNode:(BBLinkedNode *)newNode afterNodeForKey:(NSString *)key

{

if (key.length == 0 || !newNode || newNode.key.length == 0) {

return;

}

if ([self isNodeExists:newNode]) {

return;

}

if (!_headNode && !_tailNode) {

_headNode = _tailNode = newNode;

return;

}

BBLinkedNode *node = _innerMap[key];

if (node) {

_innerMap[newNode.key] = newNode;

if (node.next) {

newNode.next = node.next;

node.next.prev = newNode;

} else {

_tailNode = newNode;

}

newNode.prev = node;

node.next = newNode;

} else {

[self insertNode:newNode]; ?//insert to tail

}

}

- (void)bringNodeToHead:(BBLinkedNode *)node

{

if (!node) {

return;

}

if (!_headNode && !_tailNode) {

_headNode = _tailNode = node;

return;

}

if ([_headNode isEqual:node]) {

return;

}

if ([_tailNode isEqual:node]) {

_tailNode = node.prev;

_tailNode.next = nil;

} else {

node.prev.next = node.next;

node.next.prev = node.prev;

}

_headNode.prev = node;

node.next = _headNode;

node.prev = nil;

_headNode = node;

}

- (void)removeNodeForKey:(NSString *)key

{

if (key.length == 0) {

return;

}

BBLinkedNode *node = _innerMap[key];

if (!node) {

return;

}

[_innerMap removeObjectForKey:key];

if ([_headNode isEqual:node]) {

_headNode = node.next;

} else if ([_tailNode isEqual:node]) {

_tailNode = node.prev;

}

node.prev.next = node.next;

node.next.prev = node.prev;

}

- (void)removeTailNode

{

if (!_tailNode || _tailNode.key.length == 0) {

return;

}

[_innerMap removeObjectForKey:_tailNode.key];

if (_headNode == _tailNode) {

_headNode = _tailNode = nil;

return;

}

_tailNode = _tailNode.prev;

_tailNode.next = nil;

}

- (BBLinkedNode *)nodeForKey:(NSString *)key

{

if (key.length == 0) {

return nil;

}

BBLinkedNode *node = _innerMap[key];

return node;

}

- (BBLinkedNode *)headNode

{

return _headNode;

}

- (BBLinkedNode *)tailNode

{

return _tailNode;

}

- (void)readAllNode

{

BBLinkedNode *node = _headNode;

while (node) {

NSLog(@"node key -- %@, node value -- %@", node.key, node.value);

node = node.next;

}

}

- (NSInteger)length

{

NSInteger _len = 0;

for (BBLinkedNode *node = _headNode; node; node = node.next) {

_len ++;

}

return _len;

}

- (BOOL)isEmpty

{

return _headNode == nil;

}

#pragma mark - private

- (BOOL)isNodeExists:(BBLinkedNode *)node

{

BBLinkedNode *tmpNode = _headNode;

while (tmpNode) {

if ([tmpNode isEqual:node]) {

return YES;

}

tmpNode = tmpNode.next;

}

return false;

}

@end

最后編輯于
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
  • 序言:七十年代末愧驱,一起剝皮案震驚了整個(gè)濱河市慰技,隨后出現(xiàn)的幾起案子,更是在濱河造成了極大的恐慌冯键,老刑警劉巖惹盼,帶你破解...
    沈念sama閱讀 216,544評(píng)論 6 501
  • 序言:濱河連續(xù)發(fā)生了三起死亡事件,死亡現(xiàn)場(chǎng)離奇詭異惫确,居然都是意外死亡手报,警方通過查閱死者的電腦和手機(jī),發(fā)現(xiàn)死者居然都...
    沈念sama閱讀 92,430評(píng)論 3 392
  • 文/潘曉璐 我一進(jìn)店門改化,熙熙樓的掌柜王于貴愁眉苦臉地迎上來掩蛤,“玉大人,你說我怎么就攤上這事陈肛∽崮瘢” “怎么了?”我有些...
    開封第一講書人閱讀 162,764評(píng)論 0 353
  • 文/不壞的土叔 我叫張陵句旱,是天一觀的道長(zhǎng)阳藻。 經(jīng)常有香客問我晰奖,道長(zhǎng),這世上最難降的妖魔是什么腥泥? 我笑而不...
    開封第一講書人閱讀 58,193評(píng)論 1 292
  • 正文 為了忘掉前任匾南,我火速辦了婚禮,結(jié)果婚禮上蛔外,老公的妹妹穿的比我還像新娘蛆楞。我一直安慰自己,他們只是感情好夹厌,可當(dāng)我...
    茶點(diǎn)故事閱讀 67,216評(píng)論 6 388
  • 文/花漫 我一把揭開白布豹爹。 她就那樣靜靜地躺著,像睡著了一般矛纹。 火紅的嫁衣襯著肌膚如雪臂聋。 梳的紋絲不亂的頭發(fā)上,一...
    開封第一講書人閱讀 51,182評(píng)論 1 299
  • 那天崖技,我揣著相機(jī)與錄音逻住,去河邊找鬼。 笑死迎献,一個(gè)胖子當(dāng)著我的面吹牛瞎访,可吹牛的內(nèi)容都是我干的。 我是一名探鬼主播吁恍,決...
    沈念sama閱讀 40,063評(píng)論 3 418
  • 文/蒼蘭香墨 我猛地睜開眼扒秸,長(zhǎng)吁一口氣:“原來是場(chǎng)噩夢(mèng)啊……” “哼!你這毒婦竟也來了冀瓦?” 一聲冷哼從身側(cè)響起伴奥,我...
    開封第一講書人閱讀 38,917評(píng)論 0 274
  • 序言:老撾萬榮一對(duì)情侶失蹤,失蹤者是張志新(化名)和其女友劉穎翼闽,沒想到半個(gè)月后拾徙,有當(dāng)?shù)厝嗽跇淞掷锇l(fā)現(xiàn)了一具尸體,經(jīng)...
    沈念sama閱讀 45,329評(píng)論 1 310
  • 正文 獨(dú)居荒郊野嶺守林人離奇死亡感局,尸身上長(zhǎng)有42處帶血的膿包…… 初始之章·張勛 以下內(nèi)容為張勛視角 年9月15日...
    茶點(diǎn)故事閱讀 37,543評(píng)論 2 332
  • 正文 我和宋清朗相戀三年尼啡,在試婚紗的時(shí)候發(fā)現(xiàn)自己被綠了。 大學(xué)時(shí)的朋友給我發(fā)了我未婚夫和他白月光在一起吃飯的照片询微。...
    茶點(diǎn)故事閱讀 39,722評(píng)論 1 348
  • 序言:一個(gè)原本活蹦亂跳的男人離奇死亡崖瞭,死狀恐怖,靈堂內(nèi)的尸體忽然破棺而出撑毛,到底是詐尸還是另有隱情书聚,我是刑警寧澤,帶...
    沈念sama閱讀 35,425評(píng)論 5 343
  • 正文 年R本政府宣布,位于F島的核電站雌续,受9級(jí)特大地震影響斩个,放射性物質(zhì)發(fā)生泄漏。R本人自食惡果不足惜西雀,卻給世界環(huán)境...
    茶點(diǎn)故事閱讀 41,019評(píng)論 3 326
  • 文/蒙蒙 一萨驶、第九天 我趴在偏房一處隱蔽的房頂上張望歉摧。 院中可真熱鬧艇肴,春花似錦、人聲如沸叁温。這莊子的主人今日做“春日...
    開封第一講書人閱讀 31,671評(píng)論 0 22
  • 文/蒼蘭香墨 我抬頭看了看天上的太陽膝但。三九已至冲九,卻和暖如春,著一層夾襖步出監(jiān)牢的瞬間跟束,已是汗流浹背莺奸。 一陣腳步聲響...
    開封第一講書人閱讀 32,825評(píng)論 1 269
  • 我被黑心中介騙來泰國打工, 沒想到剛下飛機(jī)就差點(diǎn)兒被人妖公主榨干…… 1. 我叫王不留冀宴,地道東北人灭贷。 一個(gè)月前我還...
    沈念sama閱讀 47,729評(píng)論 2 368
  • 正文 我出身青樓,卻偏偏與公主長(zhǎng)得像略贮,于是被迫代替她去往敵國和親甚疟。 傳聞我的和親對(duì)象是個(gè)殘疾皇子,可洞房花燭夜當(dāng)晚...
    茶點(diǎn)故事閱讀 44,614評(píng)論 2 353

推薦閱讀更多精彩內(nèi)容

  • 背景 一年多以前我在知乎上答了有關(guān)LeetCode的問題, 分享了一些自己做題目的經(jīng)驗(yàn)逃延。 張土汪:刷leetcod...
    土汪閱讀 12,743評(píng)論 0 33
  • 一揽祥、基本數(shù)據(jù)類型 注釋 單行注釋:// 區(qū)域注釋:/* */ 文檔注釋:/** */ 數(shù)值 對(duì)于byte類型而言...
    龍貓小爺閱讀 4,259評(píng)論 0 16
  • 鏈表(Linked List)是一種物理存儲(chǔ)單元上非連續(xù)讽膏、非順序的存儲(chǔ)結(jié)構(gòu),數(shù)據(jù)元素的邏輯順序是通過鏈表中的指針鏈...
    hi_xgb閱讀 13,265評(píng)論 11 43
  • 本文是針對(duì)剛學(xué)編程的小白,都是一些基礎(chǔ)知識(shí),如果想了解更多深層一點(diǎn)的東西,歡迎移步本人博客!! 博客地址 點(diǎn)擊跳轉(zhuǎn)...
    西巴擼閱讀 567評(píng)論 0 2
  • 我的詩人他開口唱歌, 十月的雨愈案,晚間天上沒有星星挺尾,你不言語 天氣這樣冷啊, 想和你變做兩尾魚站绪,躲在溫暖的深水遭铺,相擁...
    笛爾der閱讀 223評(píng)論 0 1