module github.com/masx200/leetcode-test/abbreviating-the-product-of-a-range

Author: masx200

abbreviating-the-product-of-a-range/export.go

@@ -0,0 +1,6 @@
+package index
+
+func AbbreviateProduct(left, right int) string {
+
+	return abbreviateProduct(left, right)
+}

abbreviating-the-product-of-a-range/go.mod

@@ -0,0 +1 @@
+module github.com/masx200/leetcode-test/abbreviating-the-product-of-a-range

abbreviating-the-product-of-a-range/index.go

@@ -0,0 +1,41 @@
+package index
+
+import (
+	"fmt"
+	"math/big"
+	"strconv"
+	"strings"
+)
+
+var factorials = make([]*big.Int, 10001)
+
+func initialization() {
+	if factorials[0] == nil {
+		var i int64 = 0
+		for ; i <= 10000; i++ {
+			if i == 0 {
+				factorials[i] = big.NewInt(1)
+			} else {
+				factorials[i] = new(big.Int).Mul(factorials[i-1], big.NewInt(i))
+			}
+
+		}
+	}
+}
+
+func abbreviateProduct(left, right int) string {
+	initialization()
+	var s string
+	if left == right {
+		s = strconv.Itoa(left)
+	} else {
+		s = new(big.Int).Div(factorials[right], factorials[left-1]).String()
+	}
+	tz := len(s)
+	s = strings.TrimRight(s, "0")
+	tz -= len(s)
+	if len(s) > 10 {
+		return fmt.Sprintf("%s...%se%d", s[:5], s[len(s)-5:], tz)
+	}
+	return fmt.Sprintf("%se%d", s, tz)
+}

go.work

@@ -1,6 +1,7 @@
 go 1.19
 
 use (
+	./abbreviating-the-product-of-a-range
 	.
 	./check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
 	./counting-words-with-a-given-prefix
@@ -16,5 +17,5 @@ use (
 	./serialize-and-deserialize-binary-tree
 	./transform-to-chessboard
 	./utils
-    ./count-complete-tree-nodes
+	./count-complete-tree-nodes
 )