feat: add solutions to lc problem: No.0970. Powerful Integers

Author: yanglbme

solution/0900-0999/0970.Powerful Integers/README.md

@@ -44,7 +44,6 @@
 	<li><code>0 &lt;= bound&nbsp;&lt;= 10^6</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -56,15 +55,48 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def powerfulIntegers(self, x: int, y: int, bound: int) -> List[int]:
+        s = set()
+        i = 1
+        while i < bound:
+            j = 1
+            while j < bound:
+                if i + j <= bound:
+                    s.add(i + j)
+                if y == 1:
+                    break
+                j *= y
+            if x == 1:
+                break
+            i *= x
+        return list(s)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public List<Integer> powerfulIntegers(int x, int y, int bound) {
+        Set<Integer> s = new HashSet<>();
+        for (int i = 1; i < bound; i *= x) {
+            for (int j = 1; j < bound; j *= y) {
+                if (i + j <= bound) {
+                    s.add(i + j);
+                }
+                if (y == 1) {
+                    break;
+                }
+            }
+            if (x == 1) {
+                break;
+            }
+        }
+        return new ArrayList<>(s);
+    }
+}
 ```
 
 ### **...**

solution/0900-0999/0970.Powerful Integers/README_EN.md

@@ -49,13 +49,46 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def powerfulIntegers(self, x: int, y: int, bound: int) -> List[int]:
+        s = set()
+        i = 1
+        while i < bound:
+            j = 1
+            while j < bound:
+                if i + j <= bound:
+                    s.add(i + j)
+                if y == 1:
+                    break
+                j *= y
+            if x == 1:
+                break
+            i *= x
+        return list(s)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public List<Integer> powerfulIntegers(int x, int y, int bound) {
+        Set<Integer> s = new HashSet<>();
+        for (int i = 1; i < bound; i *= x) {
+            for (int j = 1; j < bound; j *= y) {
+                if (i + j <= bound) {
+                    s.add(i + j);
+                }
+                if (y == 1) {
+                    break;
+                }
+            }
+            if (x == 1) {
+                break;
+            }
+        }
+        return new ArrayList<>(s);
+    }
+}
 ```
 
 ### **...**

solution/0900-0999/0970.Powerful Integers/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public List<Integer> powerfulIntegers(int x, int y, int bound) {
+        Set<Integer> s = new HashSet<>();
+        for (int i = 1; i < bound; i *= x) {
+            for (int j = 1; j < bound; j *= y) {
+                if (i + j <= bound) {
+                    s.add(i + j);
+                }
+                if (y == 1) {
+                    break;
+                }
+            }
+            if (x == 1) {
+                break;
+            }
+        }
+        return new ArrayList<>(s);
+    }
+}

solution/0900-0999/0970.Powerful Integers/Solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def powerfulIntegers(self, x: int, y: int, bound: int) -> List[int]:
+        s = set()
+        i = 1
+        while i < bound:
+            j = 1
+            while j < bound:
+                if i + j <= bound:
+                    s.add(i + j)
+                if y == 1:
+                    break
+                j *= y
+            if x == 1:
+                break
+            i *= x
+        return list(s)