Skip to content

week4 homework #672

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
GeekUniversity merged 1 commit into from
May 13, 2019
Merged

week4 homework #672

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
26 changes: 26 additions & 0 deletions Week_04/id_36/LeetCode_169_036.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
package com.potato.leetcode;

import java.util.HashMap;
import java.util.Map;

public class LeetCode_169_036 {
public int majorityElement(int[] nums) {
Map<Integer, Integer> map = new HashMap<>();
int n = nums.length;
int count = 0;
for (int i : nums) {
if (map.containsKey(i)) {
count = map.get(i) + 1;
} else {
count = 1;
}

if (count > n / 2) {
return i;
}

map.put(i, count);
}
return -1;
}
}
29 changes: 29 additions & 0 deletions Week_04/id_36/LeetCode_746_036.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
package com.potato.leetcode;

public class LeetCode_746_036 {
public int minCostClimbingStairs(int[] cost) {
if (cost == null) {
return 0;
}

if (cost.length == 1) {
return cost[0];
}

if (cost.length == 2) {
return Math.min(cost[0], cost[1]);
}

int[] tmp = new int[2];
tmp[0] = cost[0];
tmp[1] = cost[1];

int min = 0;
for (int i = 2; i < cost.length; i++) {
min = Math.min(tmp[0], tmp[1]);
tmp[0] = tmp[1];
tmp[1] = min + cost[i];
}
return Math.min(tmp[0], tmp[1]);
}
}