add code

Author: ncdhz

code/1620.网络信号最好的坐标.java

@@ -0,0 +1,46 @@
+/*
+ * @lc app=leetcode.cn id=1620 lang=java
+ *
+ * [1620] 网络信号最好的坐标
+ */
+
+// @lc code=start
+class Solution {
+ public int[] bestCoordinate(int[][] towers, int radius) {
+
+ int xMax = Integer.MIN_VALUE;
+ int yMax = Integer.MIN_VALUE;
+
+ for (int[] tower: towers) {
+ xMax = xMax > tower[0] ? xMax : tower[0];
+ yMax = yMax > tower[1] ? yMax : tower[1];
+ }
+
+
+ int sum = 0;
+ int[] r = {0, 0};
+
+ for (int x = 0; x < xMax + 1; x++) {
+ for (int y = 0; y < yMax + 1; y++) {
+ int s = 0;
+ for (int j = 0; j < towers.length; j++) {
+ int xx = x - towers[j][0];
+ int yy = y - towers[j][1];
+ double z = Math.sqrt(xx * xx + yy * yy);
+ if (z <= radius) {
+ s += Math.floor(towers[j][2] / (1 + z));
+ }
+ }
+ if (s > sum) {
+ sum = s;
+ r[0] = x;
+ r[1] = y;
+ } 
+ }
+ }
+ 
+ return r;
+ }
+}
+// @lc code=end
+

code/599.两个列表的最小索引总和.java

@@ -0,0 +1,43 @@
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+import javax.lang.model.element.Element;
+
+/*
+ * @lc app=leetcode.cn id=599 lang=java
+ *
+ * [599] 两个列表的最小索引总和
+ */
+
+// @lc code=start
+class Solution {
+ public String[] findRestaurant(String[] list1, String[] list2) {
+
+ Map<String, Integer> ss = new HashMap<>();
+ for (int i = 0; i < list2.length; i++) {
+ ss.put(list2[i], i);
+ }
+
+ List<String> rs = new ArrayList<>();
+ int m = Integer.MAX_VALUE;
+ for (int i = 0; i < list1.length; i++) {
+ if (ss.containsKey(list1[i])) {
+ int j = ss.get(list1[i]) + i;
+ if (j < m) {
+ rs.clear();
+ m = j;
+ 
+ } else if (j > m) {
+ continue;
+ } 
+ rs.add(list1[i]);
+ }
+ }
+
+ return rs.toArray(new String[0]);
+ }
+}
+// @lc code=end
+