Mun: 6월 3주차 문제 풀이

06월/2주차/[LCD] Find the Index of the First Occurrence in a String/Mun.java

@@ -1,18 +1,20 @@
-class Mun {
-    public int searchInsert(int[] nums, int target) {
-        int end = nums.length - 1;
-        int front = 0;
-        while(front <= end) {
-            int mid = (end + front) / 2;
-            int n = nums[mid];
-            if(n > target) {
-                end = mid - 1;
-            } else if (n < target) {
-                front = mid + 1;
-            } else {
-                return mid;
+class Solution {
+    public int strStr(String haystack, String needle) {
+        int len = needle.length();
+
+        for(int i=0;i<haystack.length()-len+1;i++) {
+            boolean same = true;
+            for(int j=0;j<len;j++) {
+                if(haystack.charAt(i+j) != needle.charAt(j)) {
+                    same = false;
+                    break;
+                }
+            }
+            if(same) {
+                return i;
             }
         }
-        return front;
+
+        return -1;
     }
 }

06월/3주차/[LCD] Length of Last Word/Mun.java

@@ -0,0 +1,6 @@
+class Mun {
+    public int lengthOfLastWord(String s) {
+        String[] arr = s.split(" ");
+        return arr[arr.length-1].length();
+    }
+}

06월/3주차/[LCD] Plus One/Mun.java

@@ -0,0 +1,14 @@
+class Mun {
+    public int[] plusOne(int[] digits) {
+        for(int i=digits.length-1;i>=0;i--) {
+            if(digits[i] < 9) {
+                digits[i]++;
+                return digits;
+            }
+            digits[i] = 0;
+        }
+        int[] ans = new int[digits.length+1];
+        ans[0] = 1;
+        return ans;
+    }
+}