[C++&Rust]LeetCode No.12 integer to Roman numeral
Original address: http://blog.leanote.com/post/dawnmagnet/d23f1485c8a4 subject Roman numerals contain the following seven characters: I, V, X, L, C, D and M. character numerical value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, the Roman numeral 2 is written as II, which means two paralleUTF-8...
Posted by crash58 on Sat, 15 May 2021 04:34:22 +0930
Sword finger Offer heap part
Comments (heap sort resolution) JS heap sort The heap is a complete binary tree. Complete binary tree: except for the last layer of binary tree, the number of nodes of other layers reaches the maximum, and all nodes of the last layer are concentrated on the left side (only when the left side iUTF-8...
Posted by Steve Mellor on Mon, 17 May 2021 06:24:41 +0930
LeetCode C++ 1861. Rotating the Box[Queue/Two Pointers]
You are given an m x n matrix of characters box representing a side-view of a box. Each cell of the box is one of the following: A stone '#'A stationary obstacle '*'Empty '.' The box is rotated 90 degrees clockwise, causing some of the stones to fall due to gravity. Each stone falls down until UTF-8...
Posted by bltesar on Tue, 18 May 2021 05:30:35 +0930
[algorithm] detailed explanation of related topics of leetcode single linked list
1. leetcode_21 - merge two ordered linked lists Merge two ascending lists into a new ascending list and return. The new linked list is composed of all the nodes of the given two linked lists. Example 1: Input: l1 = [1,2,4], l2 = [1,3,4] Output:[1,1,2,3,4,4] Example 2: Input: l1 = [], l2 = [] OUTF-8...
Posted by Revos on Tue, 18 May 2021 07:34:36 +0930
LeetCode 146. LRU caching mechanism
1. Title Design and implement an LRU (least recently used) caching mechanism with your data structure. Implement the LRUCache class: LRUCache(int capacity) initializes the LRU cache with a positive integer as the capacityint get(int key) if the key exists in the cache, the value of the key is UTF-8...
Posted by internet-solution on Wed, 19 May 2021 04:20:53 +0930
BFS of AK F.*ing leetcode program
Welcome to pay attention to more wonderful Pay attention to me, learn common algorithms and data structure, one problem with multiple solutions, dimension reduction. 1, Introduction Breadth first search (BFS) is a graph traversal method, similar to the hierarchical tree traversal. Graph applicaUTF-8...
Posted by funguse on Sun, 23 May 2021 07:24:02 +0930
Personal study notes_ 61_ Shunzi in playing cards
Date: 8:33 PM, Tuesday, May 25, 2021 Personal brush question record, code collection, source is leetcode After a lot of discussion and consultation, I'm going to work towards Java The main answer language is Java Title: Sword finger Offer 61. Shunzi in playing cards Simple 131 Randomly draw 5 UTF-8...
Posted by ronthu on Wed, 26 May 2021 06:10:56 +0930
[009] leetcode 23 merges K ascending linked lists
Topic 23 Merge K ascending linked lists 9.1 official analysis click here (when I first did this problem, I first thought of merging the two linked lists in order, but what I wrote was always overtime. Compared with the sequential merging in the solution, it was too complicated and there were maUTF-8...
Posted by Buchead on Fri, 28 May 2021 02:35:08 +0930
LeetCode the sum of two numbers
Title: Given an integer array nums and a target value target, please find the two integers in the array whose target value is sum and return their array subscripts. You can assume that each input corresponds to only one answer. However, the same element in an array cannot be used twice. ExampleUTF-8...
Posted by delhiris on Fri, 28 May 2021 04:00:13 +0930
Leetcode 1074: number of submatrix with element sum as target value (difficult! Prefix and + hash table)
Title: The matrix and target value are given, and the number of non empty submatrixes whose sum of elements is equal to the target value is returned. Thinking: This topic is similar to 363. Rectangular area does not exceed the maximum sum of K, 560. Sum is a subarray of K, and 2. Sum of two numUTF-8...
Posted by matbennett on Sun, 30 May 2021 07:29:45 +0930