Skip to content

Commit 0fa3e9a

Browse files
rename
1 parent d37cc6f commit 0fa3e9a

File tree

2 files changed

+2
-2
lines changed

2 files changed

+2
-2
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -215,7 +215,7 @@ Your ideas/fixes/algorithms are more than welcome!
215215
|389|[Find the Difference](https://leetcode.com/problems/find-the-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_389.java)| O(n)|O(1) | Easy|
216216
|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestAbsoluteFilePath.java)| O(n)|O(d) | Medium| Stack
217217
|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_387.java)| O(n)|O(n) | Easy| HashMap
218-
|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LexicographicalNumbers.java)| O(n)|O(1) | Medium|
218+
|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_386.java)| O(n)|O(1) | Medium|
219219
|385|[Mini Parser](https://leetcode.com/problems/mini-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_385.java)| O(n)|O(h) | Medium| Stack
220220
|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_384.java)| O(n)|O(n) | Medium|
221221
|383|[Ransom Note](https://leetcode.com/problems/ransom-note/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_383.java)| O(n)|O(n) | Medium|

src/main/java/com/fishercoder/solutions/LexicographicalNumbers.java renamed to src/main/java/com/fishercoder/solutions/_386.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
99
1010
Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.*/
11-
public class LexicographicalNumbers {
11+
public class _386 {
1212
//Radix sort doesn't apply here! Don't confuse myself!
1313

1414
//rewrote their solution from Python to Java:https://discuss.leetcode.com/topic/54986/python-memory-limit-exceeded-for-problem-386/17

0 commit comments

Comments
 (0)