906 finish

Author: aQuaYi

Algorithms/0906.super-palindromes/super-palindromes.go

@@ -1,6 +1,34 @@
 package problem0906
 
+import (
+	"sort"
+	"strconv"
+)
+
+// square root of all superpalindrome
+var palindromes = []int{
+	1, 2, 3,
+	11, 22,
+	101, 111, 121, 202, 212,
+	1001, 1111, 2002,
+	10001, 10101, 10201, 11011, 11111, 11211, 20002, 20102,
+	100001, 101101, 110011, 111111, 200002,
+	1000001, 1001001, 1002001, 1010101, 1011101, 1012101, 1100011, 1101011, 1102011, 1110111, 1111111, 2000002, 2001002,
+	10000001, 10011001, 10100101, 10111101, 11000011, 11011011, 11100111, 11111111, 20000002,
+	100000001, 100010001, 100020001, 100101001, 100111001, 100121001, 101000101, 101010101, 101020101, 101101101, 101111101, 110000011, 110010011, 110020011, 110101011, 110111011, 111000111, 111010111, 111101111, 111111111, 200000002, 200010002,
+}
+
 func superpalindromesInRange(L, R string) int {
+	l, _ := strconv.Atoi(L)
+	r, _ := strconv.Atoi(R)
+
+	li := sort.Search(len(palindromes), func(i int) bool {
+		return l <= palindromes[i]*palindromes[i]
+	})
+
+	ri := sort.Search(len(palindromes), func(i int) bool {
+		return r <= palindromes[i]*palindromes[i]
+	})
 
-	return 0
+	return ri - li
 }

Algorithms/0906.super-palindromes/super-palindromes_test.go

@@ -13,6 +13,24 @@ var tcs = []struct {
 	ans  int
 }{
 
+	{
+		"1020762146323",
+		"142246798855636",
+		17,
+	},
+
+	{
+		"398904669",
+		"13479046850",
+		6,
+	},
+
+	{
+		"1",
+		"2",
+		1,
+	},
+
 	{
 		"4",
 		"1000",