数据结构笔试题2

little star*

于 2019-12-13 22:30:05 发布

阅读量197

点赞数

分类专栏：刷题刷题文章标签：数据结构 python

本文链接：https://blog.csdn.net/Candance_star/article/details/103534075

版权

刷题刷题专栏收录该内容

34 篇文章 1 订阅

订阅专栏

version_4

1.旋转字符串

def rotate_strings(A, p):
	if A is None or len(A) == 1:
		return A
	else:
		listA = list(A)
		list1 = listA[:p]
		list2 = listA[p:]
		result = list2 + list1
		return "".join(result)

2.将字符串转换为整数

def str_to_int(string):
	res,mult,flag = 0,1,1
    if not string:
        return res
    if string[0] == '-' or string[0] == '+':
        if string[0] == '-':
            flag = -1
        string = string[1:]
    for i in range(len(s)-1, -1, -1):
        if '0' <= string[i] <= '9':
            res += (ord(s[i]) - 48) * mult
            mult = mult * 10
        else:
            return 0
    return res*flag

version_5

1.寻找数组中出现一半次数的数

def HalfLengthSolution(numbers):
	if len(numbers) == 0:
		return None
	count = 1
    now = numbers[0]
    length = len(numbers)
    for i in range(1,length):
    	if count == 0:
        	now = numbers[i]
            count += 1
        else:
            if numbers[i] == now:
                count += 1
            else:
                count -= 1
    test = 0
    for item in numbers:
        if item == now:
            test += 1
    if test > length/2:
        return now
    else:
        return None

2.寻找数组中第一个只出现一次的数字

def find_only_one_number(numbers):
	if not numbers:
		return None
	elif len(numbers) == 1:
		return numbers[0]
	else:
		for i in numbers:
			if numbers.count(i) == 1:
				return i
			else:
				return None