BytePudding

Description Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1: Input: s = "Hello World" Output: 5 Explanation: The last word is "World" with length 5. Example 2: Input: s = " fly me to the moon " Output: 4 Explanation: The last word is "moon" with length 4. Solution c..

Description Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + The number 27 is written as XXVII, which is XX + V + II. Roman numerals are usually written largest to smallest from left to right...

Description Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example 1: Input: nums = [3,2,3] Output: 3 Example 2: Input: nums = [2,2,1,1,1,2,2] Output: 2 Solution Arrays.sort(nums); int result = nums[nums.length/2]; return result; Approach In ..

Description Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Example1 Input : head = [1,2,2,1] Output : true Example2 Input : head = [1,2] Output : false Solution class Solution { public boolean isPalindrome(ListNode head) { ListNode slow = head, fast = head, prev, temp; while (fast != null && fast.next != null) { slow = slow.next; fast = fast.next.ne..

Description Given the head of a singly linked list and two integers left and right where left

문제를 제대로 안읽고 풀엇더니 오래걸렸다. non-decreasing order는 오름차순이라는 뜻이고 , 중복 값을 제거한 배열의 길이를 반환하는 문제이다. Description Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums. Consider the number of unique elements of nums..

지정된 배열의 요소를 삭제하는 문제이다. 배열의 인덱스만 변경해 간단하게 풀었다. Description Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things: Chan..

두 개의 배열을 합치고 , 오름차순 정렬로 반환하는 문제이다. sort 메소드를 사용해서 간단히 해결했다. # Description You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instea..

LinkedList의 노드에는 이진수로만 이루어져있으며, 이를 십진수로 바꾸는 문제이다. Description Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number. Return the decimal value of the number in the linked list. The most significant bit is at the head of the linked list. Example 1: Input: head = [1,0,1] O..

중복값이 나오면 포인터를 리스트에서 빼는 문제이다. 요소를 Set 자료구조에 넣은 후,Set자료구조에 포함되면 이전포인터가 현재포인터를 건너띄고 다음포인터를 향하도록 하였다. 자바인데 컴파일러를 C로 했더니 계속 오류가 낫다 -- # Description Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. Example 1: Input: head = [1,1,2] Output: [1,2] Example 2: Input: head = [1,1,2,3,3] Output: [1,2,3] #Solution cl..