Skip to content

Commit 81c02ba

Browse files
authored
Added exec time 869-882.
1 parent 35a806a commit 81c02ba

File tree

15 files changed

+101
-66
lines changed

15 files changed

+101
-66
lines changed

src.save/main/java/g0801_0900/s0869_reordered_power_of_2/Solution.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0801_0900.s0869_reordered_power_of_2;
22

33
// #Medium #Math #Sorting #Counting #Enumeration
4+
// #2022_03_28_Time_9_ms_(25.97%)_Space_42.8_MB_(11.69%)
45

56
import java.util.HashMap;
67
import java.util.Map;

src.save/main/java/g0801_0900/s0870_advantage_shuffle/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0801_0900.s0870_advantage_shuffle;
22

3-
// #Medium #Array #Sorting #Greedy
3+
// #Medium #Array #Sorting #Greedy #2022_03_28_Time_188_ms_(28.01%)_Space_116.9_MB_(5.12%)
44

55
import java.util.ArrayDeque;
66
import java.util.ArrayList;

src.save/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops/Solution.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0801_0900.s0871_minimum_number_of_refueling_stops;
22

33
// #Hard #Array #Dynamic_Programming #Greedy #Heap_Priority_Queue
4+
// #2022_03_28_Time_3_ms_(88.52%)_Space_48.8_MB_(60.04%)
45

56
import java.util.PriorityQueue;
67

src.save/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,28 @@
11
package g0801_0900.s0872_leaf_similar_trees;
22

33
// #Easy #Depth_First_Search #Tree #Binary_Tree
4+
// #2022_03_28_Time_0_ms_(100.00%)_Space_41.8_MB_(64.12%)
45

56
import com_github_leetcode.TreeNode;
67
import java.util.ArrayList;
78
import java.util.List;
89
import java.util.Objects;
910

11+
/*
12+
* Definition for a binary tree node.
13+
* public class TreeNode {
14+
* int val;
15+
* TreeNode left;
16+
* TreeNode right;
17+
* TreeNode() {}
18+
* TreeNode(int val) { this.val = val; }
19+
* TreeNode(int val, TreeNode left, TreeNode right) {
20+
* this.val = val;
21+
* this.left = left;
22+
* this.right = right;
23+
* }
24+
* }
25+
*/
1026
public class Solution {
1127
public boolean leafSimilar(TreeNode root1, TreeNode root2) {
1228
List<Integer> list1 = new ArrayList<>();

src.save/main/java/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/Solution.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0801_0900.s0873_length_of_longest_fibonacci_subsequence;
22

33
// #Medium #Array #Hash_Table #Dynamic_Programming
4+
// #2022_03_28_Time_120_ms_(92.64%)_Space_115.6_MB_(63.42%)
45

56
public class Solution {
67
public int lenLongestFibSubseq(int[] arr) {

src.save/main/java/g0801_0900/s0874_walking_robot_simulation/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0801_0900.s0874_walking_robot_simulation;
22

3-
// #Medium #Array #Simulation
3+
// #Medium #Array #Simulation #2022_03_28_Time_16_ms_(93.75%)_Space_50.9_MB_(75.89%)
44

55
import java.util.HashMap;
66
import java.util.Map;

src.save/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0801_0900.s0875_koko_eating_bananas;
22

3-
// #Medium #Array #Binary_Search
3+
// #Medium #Array #Binary_Search #2022_03_28_Time_15_ms_(91.32%)_Space_55_MB_(6.01%)
44

55
public class Solution {
66
public int minEatingSpeed(int[] piles, int h) {

src.save/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java

Lines changed: 13 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,21 @@
11
package g0801_0900.s0876_middle_of_the_linked_list;
22

3-
// #Easy #Two_Pointers #Linked_List
3+
// #Easy #Two_Pointers #Linked_List #Algorithm_I_Day_5_Two_Pointers
4+
// #Programming_Skills_I_Day_10_Linked_List_&_Tree
5+
// #2022_03_28_Time_0_ms_(100.00%)_Space_42_MB_(26.38%)
46

57
import com_github_leetcode.ListNode;
68

9+
/*
10+
* Definition for singly-linked list.
11+
* public class ListNode {
12+
* int val;
13+
* ListNode next;
14+
* ListNode() {}
15+
* ListNode(int val) { this.val = val; }
16+
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
17+
* }
18+
*/
719
public class Solution {
820
public ListNode middleNode(ListNode head) {
921
ListNode fast = head;

src.save/main/java/g0801_0900/s0877_stone_game/Solution.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0801_0900.s0877_stone_game;
22

33
// #Medium #Array #Dynamic_Programming #Math #Game_Theory
4+
// #2022_03_28_Time_0_ms_(100.00%)_Space_41.7_MB_(79.95%)
45

56
public class Solution {
67
public boolean stoneGame(int[] piles) {

src.save/main/java/g0801_0900/s0878_nth_magical_number/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0801_0900.s0878_nth_magical_number;
22

3-
// #Hard #Math #Binary_Search
3+
// #Hard #Math #Binary_Search #2022_03_28_Time_0_ms_(100.00%)_Space_39_MB_(90.59%)
44

55
@SuppressWarnings("java:S3518")
66
public class Solution {

0 commit comments

Comments
 (0)