Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit8ce241d

Browse files
refactor 1103
1 parentd89febd commit8ce241d

File tree

1 file changed

+0
-34
lines changed

1 file changed

+0
-34
lines changed

‎src/main/java/com/fishercoder/solutions/_1103.java

Lines changed: 0 additions & 34 deletions
Original file line numberDiff line numberDiff line change
@@ -3,40 +3,6 @@
33
importjava.util.HashMap;
44
importjava.util.Map;
55

6-
/**
7-
* 1103. Distribute Candies to People
8-
*
9-
* We distribute some number of candies, to a row of n = num_people people in the following way:
10-
* We then give 1 candy to the first person, 2 candies to the second person, and so on until we give n candies to the last person.
11-
* Then, we go back to the start of the row, giving n + 1 candies to the first person, n + 2 candies to the second person,
12-
* and so on until we give 2 * n candies to the last person.
13-
* This process repeats (with us giving one more candy each time, and moving to the start of the row
14-
* after we reach the end) until we run out of candies.
15-
* The last person will receive all of our remaining candies (not necessarily one more than the previous gift).
16-
* Return an array (of length num_people and sum candies) that represents the final distribution of candies.
17-
*
18-
* Example 1:
19-
* Input: candies = 7, num_people = 4
20-
* Output: [1,2,3,1]
21-
* Explanation:
22-
* On the first turn, ans[0] += 1, and the array is [1,0,0,0].
23-
* On the second turn, ans[1] += 2, and the array is [1,2,0,0].
24-
* On the third turn, ans[2] += 3, and the array is [1,2,3,0].
25-
* On the fourth turn, ans[3] += 1 (because there is only one candy left), and the final array is [1,2,3,1].
26-
*
27-
* Example 2:
28-
* Input: candies = 10, num_people = 3
29-
* Output: [5,2,3]
30-
* Explanation:
31-
* On the first turn, ans[0] += 1, and the array is [1,0,0].
32-
* On the second turn, ans[1] += 2, and the array is [1,2,0].
33-
* On the third turn, ans[2] += 3, and the array is [1,2,3].
34-
* On the fourth turn, ans[0] += 4, and the final array is [5,2,3].
35-
*
36-
* Constraints:
37-
* 1 <= candies <= 10^9
38-
* 1 <= num_people <= 1000
39-
* */
406
publicclass_1103 {
417
publicstaticclassSolution1 {
428
publicint[]distributeCandies(intcandies,intnumPeople) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp