Leetcode 279. Perfect Squares (Medium) (cpp)

最新推荐文章于 2021-06-15 08:20:22 发布

Niko_Ke

最新推荐文章于 2021-06-15 08:20:22 发布

阅读量499

点赞数

分类专栏： Leetcode C++ C++ Leetcode Math Leetcode Dynamic Programming Leetcode Breadth-first Search 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52254669

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Dynamic Programming

47 篇文章 0 订阅

订阅专栏

Leetcode 279. Perfect Squares (Medium) (cpp)

Tag: Dynamic Programming, Breadth-first Search, Math

Difficulty: Medium

/*

279. Perfect Squares (Medium)

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.

For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return 2 because 13 = 4 + 9.

*/
class Solution {
public:
	int numSquares(int n) {
		if (n <= 0) return 0;
		static vector<int> table{(0)};
		while (table.size() <= n) {
			int _size = table.size();
			int temp = INT_MAX;
			for (int i = 1; i * i <= _size; i++)
				temp = min(temp, table[_size - i * i] + 1);
			table.push_back(temp);
		}
		return table[n];
	}
};