thảo luận Leetcode mỗi ngày

class Solution:
    def countSubarrays(self, nums: List[int], minK: int, maxK: int) -> int:
        l, minIdx, maxIdx = -1, -1, -1
        ans = 0
        for i, n in enumerate(nums):
            if n < minK or n > maxK:
                l, minIdx, maxIdx = i, -1, -1
                continue

            if n == minK:
                minIdx = i

            if n == maxK:
                maxIdx = i

            if minIdx >= 0 and maxIdx >= 0:
                ans += min(minIdx, maxIdx) - l

        return ans

class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        length = 0
        for i in range(len(s)-1, -1, -1):
            if s[i] == ' ' and length == 0:
                continue
            if s[i] != ' ':
                length += 1
            else:
                break
        return length

class Solution {
    public int lengthOfLastWord(String s) {
        int res = 0;
        for(int i = s.length()-1; i>=0; i--){
            if(s.charAt(i) != ' '){
                res=1;
                int j = i-1;
                while(j >= 0 && s.charAt(j--) != ' '){
                    res++;
                }
                return res;
            }
        }
        return res;
    }
}

class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        return len(s.split()[-1])

class Solution {
public:
    int lengthOfLastWord(string s) {
        int len = 0;
        for (int i = s.length() - 1; i >= 0; i--) {
            if (!isspace(s[i])) len++;
            else if (len != 0) break;
        }
        return len;
    }
};

class Solution {
    public int lengthOfLastWord(String s) {
        int ans = 0;

        for (int i = s.length() - 1; i >= 0; i--) {
            if (s.charAt(i) == ' ' && ans == 0) {
                continue;
            } else if (s.charAt(i) == ' ' && ans > 0) {
                return ans;
            }
            ans++;
        }

        return ans;
    }
}

public static int lengthOfLastWord(String str) {
    str = str.trim();
    int last = str.lastIndexOf(" ") + 1;
    return str.length() - last;
}

var lengthOfLastWord = function(s) {
    if (!s.length) return 0;
    let i = s.length - 1;
    let count = 0;

    while (i >= 0) {
        if (count === 0 && s[i] === ' ') {
            i--;
            continue;
        }
        
        if (s[i--] === ' ')  return count;
        count++;
    }

    return count;
};

class Solution {
public:
    int lengthOfLastWord(string s) {
        int re=1;
        int sta = 0;
        for(int end=1;end<s.size();++end)
        {
            if(s[end] != ' ' && s[end-1] == ' ') sta = end;
            if(s[end] == ' ' && s[end-1] != ' ') re =  end - sta;
            if(end == s.size()-1 && s[end] != ' ') re =end - sta+1;
        }
        return re;
    }
};

    public int lengthOfLastWord(String s) {
        int ans = 0;
        for(int i = s.length() - 1; i >= 0; i--){
            char value = s.charAt(i);
            if(value == ' ' && index != 0){
                break;
            }
            if(value != ' '){
                ans++;
            }
        }
        return ans;
    }

class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        temp = -1
        end = -1
        for i in range(len(s) - 1, -1, -1):
            if s[i].isspace():
                if end > -1:
                    temp = i
                    break
            elif end == -1:
                end = i
        return end - temp