Easiest Java Solution [ 100% ] [ 0ms ]
Approach\n- Take the sum of the arrival time and delayed time.\n- Perform modulo 24 to ensure the result stays within the range of 0 to 23, representing hours i
# Approach\n- Take the sum of the arrival time and delayed time.\n- Perform modulo 24 to ensure the result stays within the range of 0 to 23, representing hours in a day.\n- Return the result, which represents the delayed arrival time.\n\n# Complexity\n- Time complexity:\nO(1)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\n    public int findDelayedArrivalTime(int arrivalTime, int delayedTime) {\n        return ((arrivalTime + delayedTime) % 24);\n    }\n}\n```\n\n![193730892e8675ebafc11519f6174bee5c4a5ab0.jpeg](https://assets.leetcode.com/users/images/f9c1be34-cecf-43f5-bfd6-c00690a4a90d_1718525658.2946942.jpeg)\n
['Java']