feat:add typescript, cpp and rust solutions for (leetcode 1431,lcof 64)

lcof/面试题64. 求1+2+…+n/Solution.cpp

@@ -0,0 +1,9 @@
+class Solution
+{
+public:
+  int sumNums(int n)
+  {
+    n && (n += sumNums(n - 1));
+    return n;
+  }
+};

lcof/面试题64. 求1+2+…+n/Solution.rs

@@ -0,0 +1,6 @@
+impl Solution {
+  pub fn sum_nums(mut n: i32) -> i32 {
+      n!=0&&(n+=Solution::sum_nums(n-1),true).1;
+      n
+  }
+}

lcof/面试题64. 求1+2+…+n/Solution.ts

@@ -0,0 +1,3 @@
+var sumNums = function (n: number): number {
+  return n && n + sumNums(n - 1);
+};

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.cpp

@@ -0,0 +1,14 @@
+class Solution
+{
+public:
+  vector<bool> kidsWithCandies(vector<int> &candies, int extraCandies)
+  {
+    int maxCandies = *max_element(candies.begin(), candies.end());
+    vector<bool> ans;
+    for (int candy : candies)
+    {
+      ans.push_back(candy + extraCandies >= maxCandies);
+    }
+    return ans;
+  }
+};

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.rs

@@ -0,0 +1,6 @@
+impl Solution {
+  pub fn kids_with_candies(candies: Vec<i32>, extra_candies: i32) -> Vec<bool> {
+      let max_candies=*candies.iter().max().unwrap();
+      return candies.iter().map(|x| x+extra_candies>=max_candies).collect();
+  }
+}

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.ts

@@ -0,0 +1,4 @@
+var kidsWithCandies = function (candies: number[], extraCandies: number): boolean[] {
+  let maxCandies = Math.max(...candies);
+  return candies.map(candy => candy + extraCandies >= maxCandies);
+};