Brush questions 279. Perfect Squares

1. Title Description

Topic 279. Perfect Squares, given a positive integer n, find the square of m whose number is exactly n. Find the minimum value of m, the difficulty is Medium!

Second, my answer

bfs algorithm:

class Solution{
	public:
		//bfs
		int numSquares(int n){
			queue<int> q;
	        q.push(n);
	        int sum=0;
	        while(1){
	            int l=q.size();
	            for(int i=0;i<l;i++){
	                int f=q.front();
	                if(f==0) return sum;
	                for(int i=1;i*i<=f;i++) {
	                    if(f-i*i==0) return sum+1;
	                    q.push(f-i*i); 
	                };
	                q.pop();
	            }
	            sum++;
	        }
		}
};

The performance is as follows:

Runtime: 132 ms, faster than 42.52% of C++ online submissions for Perfect Squares.
Memory Usage: 53.2 MB, less than 5.77% of C++ online submissions for Perfect Squares.

optimization:

class Solution{
	public:
		//bfs
		int numSquares(int n){
        	queue<int> q;
	        q.push(n);
	        int level = 0;
	        vector<bool> visit(n + 1, false);
	        while(!q.empty())
	        {
	            int size = q.size();
	            level++;
	            for(int i = 0; i < size; i++)
	            {
	                int temp = q.front();
	                q.pop();
	                visit[temp] = true;
	                for(int i = 1; i * i <= temp; i++)
	                {
	                    if(temp == i * i) return level;
	                    if(!visit[temp - i * i]) q.push(temp - i * i);
	                }
	            }
	        }
	        return level; 
		}
};

Runtime: 124 ms, faster than 46.86% of C++ online submissions for Perfect Squares.
Memory Usage: 29.7 MB, less than 11.54% of C++ online submissions for Perfect Squares.

Three, optimization measures

dp：

class Solution{
	public:
		int numSquares(int n){
			vector<int> dp(n+1);
			for(int i=1;i<=n;i++){
				dp[i] = i;
			}
			for(int i=2;i<=n;i++){
				for(int j=1;j*j<=i;j++){
					dp[i] = min(dp[i],dp[i-j*j]+1);
				}
			}
			return dp[n];
		}
};

The performance is as follows:

Runtime: 108 ms, faster than 58.71% of C++ online submissions for Perfect Squares.
Memory Usage: 11.4 MB, less than 61.54% of C++ online submissions for Perfect Squares.