53 lines
1.0 KiB
Python
53 lines
1.0 KiB
Python
from string import *
|
|
from re import *
|
|
from datetime import *
|
|
from collections import *
|
|
from heapq import *
|
|
from bisect import *
|
|
from copy import *
|
|
from math import *
|
|
from random import *
|
|
from statistics import *
|
|
from itertools import *
|
|
from functools import *
|
|
from operator import *
|
|
from io import *
|
|
from sys import *
|
|
from json import *
|
|
from builtins import *
|
|
import string
|
|
import re
|
|
import datetime
|
|
import collections
|
|
import heapq
|
|
import bisect
|
|
import copy
|
|
import math
|
|
import random
|
|
import statistics
|
|
import itertools
|
|
import functools
|
|
import operator
|
|
import io
|
|
import sys
|
|
import json
|
|
from typing import *
|
|
|
|
|
|
# @leet start
|
|
class Solution:
|
|
def candy(self, ratings: List[int]) -> int:
|
|
arr = [1] * len(ratings)
|
|
for i in range(1, len(ratings)):
|
|
if ratings[i] > ratings[i - 1]:
|
|
arr[i] = arr[i - 1] + 1
|
|
|
|
for i in range(len(ratings) - 2, -1, -1):
|
|
if ratings[i] > ratings[i + 1]:
|
|
arr[i] = max(arr[i + 1] + 1, arr[i])
|
|
|
|
return sum(arr)
|
|
|
|
|
|
# @leet end
|