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

Commit 2dd2b81

Browse files
committed
minor refactorings
1 parent 1908338 commit 2dd2b81

File tree

7 files changed

+7
-7
lines changed

7 files changed

+7
-7
lines changed

‎src/main/java/com/leetcode/arrays/NestedListWeightSum.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
/**
66
* Level: Easy
7-
* Problem Link: https://leetcode.com/problems/nested-list-weight-sum/ (premium)
7+
* Problem Link: https://leetcode.com/problems/nested-list-weight-sum/
88
* Problem Description:
99
* Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element
1010
* is either an integer, or a list – whose elements may also be integers or other lists.

‎src/main/java/com/leetcode/arrays/NestedListWeightSumII.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

77
/**
88
* Level: Medium
9-
* Problem Link: https://leetcode.com/problems/nested-list-weight-sum-ii/ (premium)
9+
* Problem Link: https://leetcode.com/problems/nested-list-weight-sum-ii/
1010
* Problem Description:
1111
* Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element
1212
* is either an integer, or a list – whose elements may also be integers or other lists.

‎src/main/java/com/leetcode/dynamicprogramming/PaintHouse.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
/**
44
* Level: Easy
5-
* Problem Link: https://leetcode.com/problems/paint-house/ (premium)
5+
* Problem Link: https://leetcode.com/problems/paint-house/
66
* Problem Description:
77
* There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost
88
* of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent

‎src/main/java/com/leetcode/dynamicprogramming/PaintHouseII.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
/**
66
* Level: Hard
7-
* Problem Link: https://leetcode.com/problems/paint-house-ii/ (premium)
7+
* Problem Link: https://leetcode.com/problems/paint-house-ii/
88
* Problem Description:
99
* There are a row of n houses, each house can be painted with one of the m colors.
1010
* The cost of painting each house with a certain color is different.

‎src/main/java/com/leetcode/maps/ShortestWordDistanceII.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99

1010
/**
1111
* Level: Medium
12-
* Problem Link: https://leetcode.com/problems/shortest-word-distance-ii/ (premium)
12+
* Problem Link: https://leetcode.com/problems/shortest-word-distance-ii/
1313
* Problem Description:
1414
* Design a class which receives a list of words in the constructor, and implements a method that takes two words
1515
* word1 and word2 and return the shortest distance between these two words in the list. Your method will be called

‎src/main/java/com/leetcode/trees/ClosestBinarySearchTreeValue.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
/**
66
* Level: Easy
7-
* Problem Link: https://leetcode.com/problems/closest-binary-search-tree-value/ (premium)
7+
* Problem Link: https://leetcode.com/problems/closest-binary-search-tree-value/
88
* Problem Description:
99
* Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
1010
* <p>

‎src/main/java/com/leetcode/trees/ClosestBinarySearchTreeValueII.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
/**
66
* Level: Hard
7-
* Problem Link: https://leetcode.com/problems/closest-binary-search-tree-value-ii/ (premium)
7+
* Problem Link: https://leetcode.com/problems/closest-binary-search-tree-value-ii/
88
* Problem Description:
99
*
1010
*

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /