JAVA_Range Sum Query_Immutable_LeetCode 303 풀이 class NumArray { int[] num; public NumArray(int[] nums) { num = nums; for (int i = 1; i < nums.length; i++) { num[i] += num[i - 1]; } } public int sumRange(int left, int right) { return left == 0 ? num[right] : num[right] - num[left - 1]; } } * 출처 Level up your coding skills and quickly land a job.
This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com...
#
JAVA
#
JAVA_LeetCode303
#
JAVA_RangeSumQuery_Immutable
#
JAVA_RangeSumQuery_Immutable_LeetCode303
#
RangeSumQuery_Immutable_LeetCode303
