From 7f53a8a8524507f31d93d153f670b5ed1117bf87 Mon Sep 17 00:00:00 2001 From: yaodehuang Date: Mon, 13 Jul 2020 23:02:08 +0800 Subject: [PATCH 1/2] feat: Add javascript Solution for 1295 --- .project | 17 +++++++++++++++++ README.md | 2 +- javascript/_1295.js | 15 +++++++++++++++ 3 files changed, 33 insertions(+), 1 deletion(-) create mode 100644 .project create mode 100644 javascript/_1295.js diff --git a/.project b/.project new file mode 100644 index 0000000000..0b490d5e6a --- /dev/null +++ b/.project @@ -0,0 +1,17 @@ + + + leetcode-algorithms + Project Leetcode created by Buildship. + + + + + org.eclipse.buildship.core.gradleprojectbuilder + + + + + + org.eclipse.buildship.core.gradleprojectnature + + diff --git a/README.md b/README.md index 0e9157b0ed..44adb19a26 100644 --- a/README.md +++ b/README.md @@ -122,7 +122,7 @@ _If you like this project, please leave me a star._ ★ |1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | |Easy|| |1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | |Medium|| |1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | |Medium|| -|1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1295.java) | [:tv:](https://youtu.be/HRp8mNJvLZ0) |Easy|| +|1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|[Java](../master/src/main/java/com/fishercoder/solutions/_1295.java) [Javascript](../master/javascript/_1295.js)| [:tv:](https://youtu.be/HRp8mNJvLZ0) |Easy|| |1291|[Sequential Digits](https://leetcode.com/problems/sequential-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1291.java) | |Medium|| |1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) | |Easy|| |1289|[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1289.java) | |Hard|Dynamic Programming| diff --git a/javascript/_1295.js b/javascript/_1295.js new file mode 100644 index 0000000000..4c9ce0c6c9 --- /dev/null +++ b/javascript/_1295.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number} + */ + +var findNumbers = function(nums) { + let result = 0 + for (let i = 0;i < nums.length; i++) { + const num = String(nums[i]); + if (num.length % 2 === 0) result++ + } + return result +} + +console.log(findNumbers([12, 345, 2, 6, 7896])) From 78227a9b4fdb9e2436fe213e80434d59eac64386 Mon Sep 17 00:00:00 2001 From: yaodehuang Date: Mon, 13 Jul 2020 23:12:39 +0800 Subject: [PATCH 2/2] fix format for js --- javascript/_1295.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/javascript/_1295.js b/javascript/_1295.js index 4c9ce0c6c9..d536276b29 100644 --- a/javascript/_1295.js +++ b/javascript/_1295.js @@ -3,10 +3,10 @@ * @return {number} */ -var findNumbers = function(nums) { +var findNumbers = function (nums) { let result = 0 - for (let i = 0;i < nums.length; i++) { - const num = String(nums[i]); + for (let i = 0; i < nums.length; i++) { + const num = String(nums[i]) if (num.length % 2 === 0) result++ } return result pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy