add 3038 fot JS and Python

Author: clingoram

javascript/LeetCode/Array/3038.js

@@ -0,0 +1,24 @@
+/**
+ * 3038. Maximum Number of Operations With the Same Score I
+ * 
+ * 以陣列前兩個元素為一組做加總為一步驟，檢查下一組的加總是否跟前一組一樣，若不是，則回傳結果是一樣的步驟有幾個
+ * 要能夠取得連續加總值一樣
+ * 
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxOperations = function(nums) {
+    let count = 1;
+    let firstTwoEleSum = nums[0] + nums[1];
+    for(let i = 2;i < nums.length - 1;i+=2) {
+      if(nums[i] + nums[i+1] === firstTwoEleSum){
+        count++;
+      }else{
+        break;
+      }
+    }
+    return count;
+};
+let nums = [1,5,3,3,4,1,3,2,2,3];
+// 2
+console.log(maxOperations(nums));

python/index.py

@@ -21,13 +21,13 @@
 
 # oop
 # from file name(module) import the class.
-# from oop.Animal import Animal
-# from oop.Tortoise import Tortoise
-# from oop.Lion import Lion
-# from oop.Behavior import move
+from oop.Animal import Animal
+from oop.Tortoise import Tortoise
+from oop.Lion import Lion
+from oop.Behavior import move
 
-# greek = Tortoise("福氣",7,"veggie","地中海型陸龜")
-# greek.eat()
+greek = Tortoise("福氣",7,"veggie","地中海型陸龜")
+greek.eat()
 # greek.hibernation()
 # greek.environment()
 # greek.attack()

python/leetcode/list/3038.py

@@ -0,0 +1,16 @@
+from typing import List
+def maxOperations(nums: List[int]) -> int:
+    '''
+    3038. Maximum Number of Operations With the Same Score I
+    '''
+    count = 1
+    firstTwoEleSum = nums[0] + nums[1]
+    for i in range(2,len(nums) - 1,2):
+        if nums[i] + nums[i+1] == firstTwoEleSum:
+            count+=1
+        else:
+            break
+    return count
+
+nums = [3,2,1,4,5]
+print(maxOperations(nums))

python/oop/Tortoise.py

@@ -12,6 +12,10 @@ def __init__(self, name, age, food,speciceType:str):
         super().__init__(name, age, food)
         self.speciceType = speciceType
 
+    def eat(self):
+        cant = ["草酸高食物","糖份高，例如水果"]
+        
+        print(f"{self.food}，但有些不適合吃")
 
     def environment(self):
         '''