ChunYu's Algorithm Library
  1. 0. 1/0 Knapsack Problem
  2. 0. Bike Rental Scheduling
  3. 0. Max Sum Increasing Subsequence
  4. 1. Two Sum
  5. 19. Remove Nth Node From End of List
  6. 35. Insert Search Position
  7. 45. Jump Game II
  8. 53. Maximum Subarray
  9. 63. Unique Paths II
  10. 70. Climbing Stairs
  11. 72. Edit Distance (Levenshtein Distance)
  12. 75. Sort Colors (Dutch National Flag)
  13. 78. Subsets (Power Set)
  14. 136. Single Number
  15. 141. Linked List Cycle
  16. 150. Evaluate Reverse Polish Notation
  17. 160. Intersection of Two Linked Lists
  18. 169. Majority Element
  19. 200. Number of Islands
  20. 210. Course Schedule II
  21. 215. Kth Largest Element in an Array
  22. 226. Invert Binary Tree
  23. 231. Power of Two
  24. 234. Palindrome Linked List
  25. 237. Delete a Node in a Linked List
  26. 279. Perfect Squares
  27. 322. Coin Change
  28. 323. Number of Connected Components in an Undirected Graph
  29. 344. Reverse a String
  30. 380. Insert Delete GetRandom O(1)
  31. 383. Ransom Note
  32. 392. Is Subsequence
  33. 406. Queue Reconstruction by Height
  34. 417. Pacific Atlantic Water Flow
  35. 468. Validate IP Address
  36. 490. The Maze
  37. 509. Fibonacci Number
  38. 518. Coin Change II
  39. 520. Detect Capital
  40. 528. Random Pick with Weight
  41. 690. Employee Importance
  42. 700. Search in a Binary Search Tree
  43. 703. Kth Largest Element in a Stream
  44. 705. Design Hashset
  45. 706. Design Hashmap
  46. 733. Flood Fill
  47. 912. Sort an Array
  48. 933. Number of Recent Calls
  49. 994. Rotting Oranges
  50. 1029. Two City Scheduling
  51. 1431. Kids with Greatest Number of Candies
  52. 1436. Destination City
  53. 1437. Check If All 1's are at Least Length K Places Away
  54. 1446. Consecutive Characters
  55. 1447. Simplified Fractions
  56. .

© 2020 ChunYu Shi

1431. Kids with Greatest Number of Candies

Last Updated: 2020.06.11

Table of Contents

Resources

Question Source: Kids With the Greatest Number of Candies - LeetCode

Append to New Array: O(n) / O(n)

class Solution:
    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
        most = max(candies)
        ans = []
        for i in candies:
            if most - i > extraCandies:
                ans.append(False)
            else:
                ans.append(True)
        return ans

Modify Array in Place: O(n) / O(1)

class Solution:
    def kidsWithCandies(self, candies, extraCandies):
        maxCandies = max(candies)
        for i in range(len(candies)):
            # Ternary Operator
            candies[i] = False if candies[i] < maxCandies - extraCandies else True
        # print(maxCandies)
        return candies

s = Solution()
print(s.kidsWithCandies([2, 3, 5, 1, 3],3))
print(s.kidsWithCandies([4,2,1,1,2],1))
print(s.kidsWithCandies([12,1,2],10))