【剑指offer】Q41：和为s的连续正数序列

标签：面试题   python   algorithm   

def sumS(s):
	if s <= 0:
		return

	re = []
	first = 1; last = 2; 
	cursum = first + last
	
	while first <= s >> 1:
		if cursum < s:
			last += 1
			cursum += last
		else:
			if cursum == s:
				re.append((first, last))
			cursum -= first
			first += 1
	return re

【剑指offer】Q41：和为s的连续正数序列,布布扣,bubuko.com

【剑指offer】Q41：和为s的连续正数序列

标签：面试题   python   algorithm   

原文地址：http://blog.csdn.net/shiquxinkong/article/details/36628505