Thousand Separator - String - Easy - LeetCode

1 min read 104 words

sumitc912 October 2020Updated: 2 October 2020 1 min read

ShareWhatsApp Post on X

1The function adds a dot as a thousands separator to an integer and returns it as a string.
2For input 0, the function returns '0' as the output.
3The algorithm has a time complexity of O(n) and a space complexity of O(n).

AI-generated summary · May not capture all nuances

Key Insight

AskGif

"The function adds a dot as a thousands separator to an integer and returns it as a string."

— Thousand Separator - String - Easy - LeetCode

Given an integer n, add a dot (".") as the thousands separator and return it in string format.

Example 1:

Input: n = 987 Output: "987" Example 2:

Input: n = 1234 Output: "1.234" Example 3:

Input: n = 123456789 Output: "123.456.789" Example 4:

Input: n = 0 Output: "0"

Constraints:

0 <= n < 2^31

public class Solution {
 public string ThousandSeparator(int n) {
 if(n==0){
 return "0";
 }
 var stack = new Stack<char>();
 int i=0;
 while(n>0){
 stack.Push((char)((n%10)+48));
 n/=10;
 i++;
 if(i%3==0 && n!=0){
 stack.Push('.');
 }
 }
 
 var sb = new StringBuilder();
 while(stack.Count>0){
 sb.Append(stack.Pop());
 }
 
 return sb.ToString();
 }
}

Time Complexity: O(n)

Space Complexity: O(n)

🛒 You'll Need This

Products related to this article