jhphon0730

[Go] 11866 요세푸스 문제 0

DescriptionCodepackage mainimport ( "bufio" "fmt" "os")var ( sc = bufio.NewReader(os.Stdin) wr = bufio.NewWriter(os.Stdout) Queue []int)// 정수 X를 큐에 넣음func push(x int) { Queue = append(Queue, x)}// 큐에 가장 앞에 있는 정수를 빼고, 그 수를 출력func pop() int { if len(Queue) == 0 { return -1 } ret := Queue[0] Queue = Queue[1:] return ret}// 큐의 정수 개수 출력func size() int { return len(Queue)}// 큐의 공백 확인func empty() int ..

[Go] 18258 큐 2

DescriptionCodepackage mainimport ( "bufio" "fmt" "os")var ( sc = bufio.NewReader(os.Stdin) wr = bufio.NewWriter(os.Stdout) Que []int)// 정수 X를 큐에 넣음func push(x int) { Que = append(Que, x)}// 큐에 가장 앞에 있는 정수를 빼고, 그 수를 출력func pop() int { if len(Que) == 0 { return -1 } ret := Que[0] Que = Que[1:] return ret}// 큐의 정수 개수 출력func size() int { return len(Que)}// 큐의 공백 확인func empty() int { if len(Que) ==..

[Go] 4949 균형잡힌 세상

DescriptionCodepackage mainimport ( "bufio" "os" "fmt")var ( rd = bufio.NewReader(os.Stdin) sc = bufio.NewScanner(os.Stdin) wr = bufio.NewWriter(os.Stdout) Stack []int)func push(x int) { Stack = append(Stack, x)}func pop() int { if len(Stack) == 0 { return 0 } x := Stack[len(Stack)-1] Stack = Stack[:len(Stack)-1] return x}func main() { defer wr.Flush() for sc.Scan() { str := sc.Text() if str ..

[Go] 10773 제로

DescriptionCodepackage mainimport ( "bufio" "os" "fmt")var ( rd = bufio.NewReader(os.Stdin) sc = bufio.NewScanner(os.Stdin) wr = bufio.NewWriter(os.Stdout) Stack []int)func push(x int) { Stack = append(Stack, x)}func pop() int { if len(Stack) == 0 { return 0 } x := Stack[len(Stack)-1] Stack = Stack[:len(Stack)-1] return x}func main() { defer wr.Flush() for sc.Scan() { str := sc.Text() if str ..

DescriptionCodepackage mainimport ( "bufio" "fmt" "os")var ( sc = bufio.NewReader(os.Stdin) wr = bufio.NewWriter(os.Stdout))var Stack []int func push(x int) { Stack = append(Stack, x)}func pop() int { if len(Stack) == 0 { return -1 } x := Stack[len(Stack)-1] Stack = Stack[:len(Stack)-1] return x}func main() { defer wr.Flush() var T int fmt.Fscan(sc, &T) for i := 0; i 문자열을 입력받고 해당 문자열을 순회문자열 중 ..

DescriptionCodepackage mainimport "fmt"type ListNode struct { Val int Next *ListNode }func main() { // 1 -> 1 -> 2 -> 3 -> 3 origin := &ListNode{Val: 1, Next: &ListNode{Val: 1, Next: &ListNode{Val: 2, Next: &ListNode{Val: 3, Next: &ListNode{Val: 3, Next: nil}}}}} deleteDuplicates(origin) for origin != nil { fmt.Println(origin.Val) origin = origin.Next } // 1 -> 2 -> 3}func deleteDuplicates(hea..

DescriptionEasyTopicsCompaniesHintYou are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1:Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 stepsExample 2:Input: n = 3Output: 3Explanation: There are three ways to climb to the top.1. 1 st..

DescriptionEasyTopicsCompaniesHintGiven a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well.You must not use any built-in exponent function or operator.For example, do not use pow(x, 0.5) in c++ or x ** 0.5 in python. Example 1:Input: x = 4Output: 2Explanation: The square root of 4 is 2, so we return 2.Exa..

DescriptionEasyTopicsCompaniesGiven 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: 5Explanation: The last word is "World" with length 5.Example 2:Input: s = " fly me to the moon "Output: 4Explanation: The last word is "moon" with len..

DescriptionEasyTopicsCompaniesGiven two strings and , return the index of the first occurrence of in , or if is not part of .needlehaystackneedlehaystack-1needlehaystack Example 1:Input: haystack = "sadbutsad", needle = "sad"Output: 0Explanation: "sad" occurs at index 0 and 6.The first occurrence is at index 0, so we return 0.Example 2:Input: haystack = "leetcode", needle = "leeto"Output: -1Expl..