sum-of-square-numbers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a non-negative integer <code>c</code>, decide whether there&#39;re two integers <code>a</code> and <code>b</code> such that <code>a2 + b2 = c</code>.

&nbsp;
Example 1:

<pre>
Input: c = 5
Output: true
Explanation: 1 * 1 + 2 * 2 = 5
</pre>

Example 2:

<pre>
Input: c = 3
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= c &lt;= 231 - 1</code></li>
</ul>

judgeSquareSum

Sum of Square Numbers

Valid Perfect Square

valid-perfect-square

有效的完全平方数

Sum of Squares of Special Elements 

sum-of-squares-of-special-elements

特殊元素平方和

Math

Two Pointers

Binary Search

给定一个非负整数&nbsp;<code>c</code>&nbsp;，你要判断是否存在两个整数 <code>a</code> 和 <code>b</code>，使得&nbsp;<code>a2 + b2 = c</code> 。

&nbsp;

示例 1：

<pre>
输入：c = 5
输出：true
解释：1 * 1 + 2 * 2 = 5
</pre>

示例 2：

<pre>
输入：c = 3
输出：false
</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= c &lt;= 231 - 1</code></li>
</ul>