update leetcode

Author: intfloat

leetcode/IslandPerimeter.java

@@ -0,0 +1,34 @@
+public class Solution {
+ private static final int[] dir_x = {0, 0, 1, -1};
+ private static final int[] dir_y = {1, -1, 0, 0};
+
+ public int islandPerimeter(int[][] grid) {
+ int res = 0;
+ for (int i = 0; i < grid.length; ++i) {
+ for (int j = 0; j < grid[i].length; ++j) {
+ if (grid[i][j] != 1) {
+ continue;
+ }
+ for (int k = 0; k < 4; ++k) {
+ int nx = dir_x[k] + i;
+ int ny = dir_y[k] + j;
+ if (nx < 0 || nx >= grid.length || ny < 0 || ny >= grid[i].length || grid[nx][ny] == 0) {
+ ++res;
+ }
+ }
+ }
+ }
+ return res;
+ }
+
+ public static void main(String[] args) {
+ Solution solution = new Solution();
+ int[][] grid = new int[][]{
+ {0,1,0,0},
+ {1,1,1,0},
+ {0,1,0,0},
+ {1,1,0,0}
+ };
+ System.out.println(solution.islandPerimeter(grid));
+ }
+}

leetcode/MinimumMoveEqualArrayElements.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+ int minMoves2(vector<int>& nums) {
+ if (nums.empty()) {
+ return 0;
+ }
+ sort(nums.begin(), nums.end());
+ int median = nums[(int)nums.size() / 2];
+ int res = 0;
+ for (int i = 0; i < (int)nums.size(); ++i) {
+ res += abs(median - nums[i]);
+ }
+ return res;
+ }
+};
+
+int main() {
+ Solution solution;
+ vector<int> nums = {1, 2, 3};
+ cout << solution.minMoves2(nums) << endl;
+ return 0;
+}