From 5979c6a766f1dd42d83052743b8037d346646b5f Mon Sep 17 00:00:00 2001 From: Tahanima Chowdhury Date: Sat, 28 Aug 2021 16:43:01 +0600 Subject: [PATCH] Add cpp, java, cs solution --- .../Solution.cpp | 15 +++++++++++++++ .../Solution.cs | 14 ++++++++++++++ .../Solution.java | 14 ++++++++++++++ 3 files changed, 43 insertions(+) create mode 100644 Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cpp create mode 100644 Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cs create mode 100644 Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.java diff --git a/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cpp b/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cpp new file mode 100644 index 0000000..dac809a --- /dev/null +++ b/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + int countDigit(int n) { + return floor(log10(n) + 1); + } + + int findNumbers(vector& nums) { + int ans = 0, n = nums.size(); + for (int i = 0; i < n; i++) { + if (!(countDigit(nums[i]) & 1)) + ans++; + } + return ans; + } +}; \ No newline at end of file diff --git a/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cs b/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cs new file mode 100644 index 0000000..2d588a7 --- /dev/null +++ b/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.cs @@ -0,0 +1,14 @@ +public class Solution { + public int CountDigit(int n) { + return (int)Math.Floor(Math.Log10(n) + 1); + } + + public int FindNumbers(int[] nums) { + int ans = 0, n = nums.Length; + for (int i = 0; i < n; i++) { + if (CountDigit(nums[i]) % 2 == 0) + ans++; + } + return ans; + } +} \ No newline at end of file diff --git a/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.java b/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.java new file mode 100644 index 0000000..9f7331a --- /dev/null +++ b/Algorithms/Easy/1295_FindNumbersWithEvenNumberOfDigits/Solution.java @@ -0,0 +1,14 @@ +class Solution { + public int countDigit(int n) { + return (int)Math.floor(Math.log10(n) + 1); + } + + public int findNumbers(int[] nums) { + int ans = 0, n = nums.length; + for (int i = 0; i < n; i++) { + if (countDigit(nums[i]) % 2 == 0) + ans++; + } + return ans; + } +} \ No newline at end of file