Python 数据结构0 列表 集合 元组 字典 哈希表

List Set Tuple Dict

理解python 内置的数据结构

def List_String():
    """字符串、列表操作"""
    str = "  Hello,223, 22 every one 1 and good !  "
    print(
        str,
        '0', len(str),  # 字符串长度
        '1', str.capitalize(),  # 字符串首字母大写
        '2', str.upper(),  # 字符串全部大写
        '3', str.find('one'),  # 找字串所在位置
        '4', str.startswith('Helo'),  # 检查字符串是否以指定字符开头
        '5', str.endswith('d'),  # 是否以指定字符结尾
        '6', str.center(50, '&'),  # 将字符串以指定的宽度居中并在两侧填充指定的字符
        '7', str.isalpha(),  # 字符串是否全是以字母组成
        '8', str.isalnum(),  # 字符串是否全是以数字组成
        '9', str[2:8],  # 字符串切片(从指定的开始索引到指定的结束索引)
        '10', str.strip(),  # 修剪左右两侧空格的拷贝
        sep='\n', end='\n',
    )
    print('\n')
    # 列表
    list1 = [21, 3, 15, 7, 9, 102]
    list2 = ['heihei'] * 6
    print(
        '0', len(list1),  # 列表长度
        '1', list1[4],  # 下标寻找元素
        '2', list1.append(20), list1,  # 将元素添加到列表最后
        '3', list2.insert(3, '30'), list2,  # 将元素添加到指定位置
        '4', list1.remove(3), list1,  # 删除指定元素'3'，若没有则执行不了
        '5', list1.pop(), list1,  # 弹出最后一个元素
        '6', list1.sort(), list1,  # 排序不可逆
        '7', tuple(list1),  # 列表转换为元组（不可变的数据类型）
        '8', set(list2), list2,  # 集合（不含重复元素）
        sep='\n', end='\n',
    )


def Tuple():
    """tuple opreation"""
    print('*** tuple ***')
    tup = ()        # immutable
    tup_1 = (1,2,3,4,3)
    tup_2 = 1,[3,2],    # can change the element list in tuple
    print(tup_2)
    tup_2[1][1] = 0
    print(type(tup),type(tup_2),tup,tup_1,tup_2)


def Set():
    tup_1 = [11.2,22,3,3,1]
    print('*** set ***')
    x = {1,3,3,4,5,6,6}
    a = set()
    b = set(tup_1)
    a.add(55)
    b.remove(1) #
    x.pop()
    print(x,a,b)


def Dictionary():
    print('*** dict ***')
    # 字典，键值对结构
    scores = {'小明': 95, '小张': 78, '小王': 82}
    print(

        '0', scores['小明'],  # 字典访问数据，通过键的方式
        '1', scores.get('小明', ),  # 通过get方法并设置默认值
        '2', scores.pop("小张"), scores,  # 弹出元素
        '3', scores.popitem(), scores,  # 弹出最后一个元素
        '4', scores.clear(), scores,  # 清空字典
        sep='\n', end='\n',
    )
    # scores['小明'] = 100
    # scores['小明'] = 50
    print(' ')
    scores = {'小明': 95, '小张': 78, '小王': 82}
    scores['小明'] = 100
    print(scores.keys(),    # 字典键
          scores.values(),  # 字典值
          scores.items()    # 字典 键值对 元组
          )
    print('小明' in scores.values(), 100 in scores.values(),
          '小明' in scores.keys(), 'a' in scores.items())
    print('迭代访问字典')
    for key in scores:
        print(key, scores[key])
    for key, value in scores:
        print(key, value)

if __name__ == '__main__':
    List_String()   # excute

HashMap Python

用python 实现哈希表，通过代码理解哈希表结构

class MyHashMap:
    # must string, it is about
    def __init__(self):
        # initialize the hash space
        self.size = 6
        self.map = [None] * self.size

    def _get_hash(self, key):
        # Build Your own Hash Function, which is the sum of ASCII of char % size
        myhash = 0
        for char in str(key):
            myhash += ord(char)
        return myhash % self.size

    def add(self, key, value):
        # Add what you want
        key_hash = self._get_hash(key)
        key_value = [key, value]    # point to hash value

        if self.map[key_hash] is None:
            self.map[key_hash] = list([key_value])
            return True
        else:
            for each_pair in self.map[key_hash]:
                if each_pair[0] == key:
                    each_pair[1] = value
                    return True
            self.map[key_hash].append(key_value)
            return True

    def get(self, key):
        # visit hashmap
        key_hash = self._get_hash(key)
        if self.map[key_hash] is not None:
            for each_pair in self.map[key_hash]:
                if each_pair[0] == key: return each_pair[1]
        return None

    def delete(self, key):
        key_hash = self._get_hash(key)

        if self.map[key_hash] is None: return False
        for i in range(0, len(self.map[key_hash])):
            if self.mao[key_hash][i][0] == key:
                self.map[key_hash].pop(i)
                return True

    def print_hash(self):
        print('*** Hash Map Using Lists ***')
        for item in self.map:
            if item is not None:
                print(str(item))


if __name__ == '__main__':
    hs = MyHashMap()
    hs.add('S12z', 1111)
    hs.add('pete', '2222')
    hs.add('pete', '3333')  # overwrite
    hs.print_hash()
    print(hs.get('pete'))