【leetcode】367. Valid Perfect Square【M】【35】

Given a positive integer num, write a function which returns True if num is a perfect square else False.

Note: Do not use any built-in library function such as sqrt.

Example 1:

Input: 16
Returns: True

Example 2:

Input: 14
Returns: False

Credits:
Special thanks to @elmirap for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

最开始的想法是，从1~num/2挨个枚举，看看有没有是它的平方的，后来一想，直接挨个算，算到平方超过这个数，就结束。。

class Solution(object):
	def isPerfectSquare(self, num):
		i = 1
		#res = 1
		while 1:#i <= num:
			#print res
			res = i**2
			if res > num:
			    return False
			if res == num:
				return True
			i += 1
			#res += i+i-1
		return False