Skip to content

Commit 3f55e3c

Browse files
authored
fix: remove useless comments
1 parent bd833f1 commit 3f55e3c

File tree

1 file changed

+0
-51
lines changed

1 file changed

+0
-51
lines changed

problems/416.partition-equal-subset-sum.md

Lines changed: 0 additions & 51 deletions
Original file line numberDiff line numberDiff line change
@@ -53,57 +53,6 @@ Explanation: The array cannot be partitioned into equal sum subsets.
5353
## 代码
5454

5555
```js
56-
/*
57-
* @lc app=leetcode id=416 lang=javascript
58-
*
59-
* [416] Partition Equal Subset Sum
60-
*
61-
* https://leetcode.com/problems/partition-equal-subset-sum/description/
62-
*
63-
* algorithms
64-
* Medium (39.97%)
65-
* Total Accepted: 79.7K
66-
* Total Submissions: 198.5K
67-
* Testcase Example: '[1,5,11,5]'
68-
*
69-
* Given a non-empty array containing only positive integers, find if the array
70-
* can be partitioned into two subsets such that the sum of elements in both
71-
* subsets is equal.
72-
*
73-
* Note:
74-
*
75-
*
76-
* Each of the array element will not exceed 100.
77-
* The array size will not exceed 200.
78-
*
79-
*
80-
*
81-
*
82-
* Example 1:
83-
*
84-
*
85-
* Input: [1, 5, 11, 5]
86-
*
87-
* Output: true
88-
*
89-
* Explanation: The array can be partitioned as [1, 5, 5] and [11].
90-
*
91-
*
92-
*
93-
*
94-
* Example 2:
95-
*
96-
*
97-
* Input: [1, 2, 3, 5]
98-
*
99-
* Output: false
100-
*
101-
* Explanation: The array cannot be partitioned into equal sum subsets.
102-
*
103-
*
104-
*
105-
*
106-
*/
10756
/**
10857
* @param {number[]} nums
10958
* @return {boolean}

0 commit comments

Comments
 (0)