Kotlin
糕冷羊
这个作者很懒,什么都没留下…
展开
-
Kotlin语言之内联函数
一、内联函数 内联函数是指用inline关键字修饰的函数。 在类内定义的函数被默认成内联函数。 内联函数从源代码层看,有函数的结构,而在编译后,却不具备函数的性质。 内联函数不是在调用时发生控制转移,而是在编译时将函数体嵌入在每一个调用处。二、Java中的内联函数在java中不能显式地声明函数内联,只能间接通过JVM虚拟机实现。可以通过两种方式向虚拟机提出请求,一种是使用fi原创 2018-01-17 00:03:37 · 696 阅读 · 0 评论 -
LeetCode之Insert into a Binary Search Tree(Kotlin)
问题:Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed th...原创 2018-10-20 18:26:26 · 183 阅读 · 0 评论 -
LeetCode之Middle of the Linked List(Kotlin)
问题:Given a non-empty, singly linked list with head node head, return a middle node of linked list.If there are two middle nodes, return the second middle node.Example 1:Input: [1,2,3,4,5]Outpu...原创 2018-10-27 22:13:28 · 247 阅读 · 0 评论 -
LeetCode之Unique Email Addresses(Kotlin)
问题:Every email consists of a local name and a domain name, separated by the @ sign.For example, in alice@leetcode.com, alice is the local name, and leetcode.com is the domain name.Besides lowercas...原创 2018-11-04 23:39:25 · 681 阅读 · 0 评论 -
LeetCode之Range Sum of BST(Kotlin)
问题:Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).The binary search tree is guaranteed to have unique values.Example 1:...原创 2018-11-14 23:12:17 · 398 阅读 · 0 评论 -
LeetCode之Minimum Add to Make Parentheses Valid(Kotlin)
问题:Given a string S of ‘(’ and ‘)’ parentheses, we add the minimum number of parentheses ( ‘(’ or ‘)’, and in any positions ) so that the resulting parentheses string is valid.Formally, a parenthes...原创 2018-11-18 01:40:19 · 182 阅读 · 0 评论 -
LeetCode之Delete Columns to Make Sorted(Kotlin)
问题:We are given an array A of N lowercase letter strings, all of the same length.Now, we may choose any set of deletion indices, and for each string, we delete all the characters in those indices. ...原创 2018-11-25 00:45:59 · 219 阅读 · 0 评论 -
LeetCode之DI String Match(Kotlin)
问题:Given a string S that only contains “I” (increase) or “D” (decrease), let N = S.length.Return any permutation A of [0, 1, …, N] such that for all i = 0, …, N-1:If S[i] == “I”, then A[i] < A...原创 2018-12-01 20:18:40 · 437 阅读 · 0 评论 -
LeetCode之Reveal Cards In Increasing Order(Kotlin)
问题:In a deck of cards, every card has a unique integer. You can order the deck in any order you want.Initially, all the cards start face down (unrevealed) in one deck.Now, you do the following st...原创 2018-12-08 21:21:52 · 197 阅读 · 0 评论 -
LeetCode之Increasing Order Search Tree(Kotlin)
问题:Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.Example 1:Input: [5,3,6,...原创 2018-12-15 18:09:28 · 172 阅读 · 0 评论 -
LeetCode之Search in a Binary Search Tree(Kotlin)
问题:Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node’s value equals the given value. Return the subtree rooted with that node. If such...原创 2018-10-08 19:46:08 · 114 阅读 · 0 评论 -
LeetCode之Sort Array By Parity II(Kotlin)
问题:Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.Sort the array so that whenever A[i] is odd, i is odd; and whenever A[i] is even, ...原创 2018-10-14 16:17:33 · 288 阅读 · 0 评论 -
LeetCode之Partition Labels(Kotlin)
问题:A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representi...原创 2018-10-06 16:27:32 · 224 阅读 · 0 评论 -
LeetCode之To Lower Case(Kotlin)
问题: Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase.方法: 这个应该不用说了吧,直接看代码。具体实现:class ToLowerCase { fun toLowerCase(str: Str...原创 2018-08-04 00:34:18 · 554 阅读 · 0 评论 -
LeetCode之Score After Flipping Matrix(Kotlin)
问题: We have a two dimensional matrix A where each value is 0 or 1. A move consists of choosing any row or column, and toggling each value in that row or column: changing all 0s to 1s, and all...原创 2018-08-12 22:48:51 · 163 阅读 · 0 评论 -
LeetCode之Binary Tree Pruning(Kotlin)
问题: We are given the head node root of a binary tree, where additionally every node’s value is either a 0 or a 1. Return the same tree where every subtree (of the given tree) not containing a...原创 2018-08-18 14:36:24 · 130 阅读 · 0 评论 -
LeetCode之Find and Replace Pattern(Kotlin)
问题: You have a list of words and a pattern, and you want to know which words in words matches the pattern. A word matches the pattern if there exists a permutation of letters p so that after ...原创 2018-08-20 15:12:37 · 163 阅读 · 0 评论 -
LeetCode之Unique Morse Code Words(Kotlin)
问题: International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: “a” maps to “.-“, “b” maps to “-…”, “c” maps to “-.-.”, and so on...原创 2018-08-25 22:14:15 · 136 阅读 · 0 评论 -
LeetCode之Flipping an Image(Kotlin)
问题: Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image. To flip an image horizontally means that each row of the image is reversed...原创 2018-09-05 14:34:18 · 123 阅读 · 0 评论 -
LeetCode之All Paths From Source to Target(Kotlin)
问题: Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and return them in any order. The graph is given as follows: the nodes are 0, 1, …, graph.le...原创 2018-09-16 13:32:32 · 147 阅读 · 0 评论 -
LeetCode之Peak Index in a Mountain Array(Kotlin)
问题: Let’s call an array A a mountain if the following properties hold: A.length >= 3 There exists some 0 < i < A.length - 1 such that A[0] < A[1] < … A[i-1] < A[i] > A...原创 2018-09-10 13:52:02 · 189 阅读 · 0 评论 -
LeetCode之Sort Array By Parity(Kotlin)
问题:Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.You may return any answer array that satisfies this con...原创 2018-09-22 18:51:03 · 206 阅读 · 0 评论 -
LeetCode之Projection Area of 3D Shapes(Kotlin)
问题:On a N * N grid, we place some 1 * 1 * 1 cubes that are axis-aligned with the x, y, and z axes.Each value v = grid[i][j] represents a tower of v cubes placed on top of grid cell (i, j).Now we v...原创 2018-12-23 21:38:17 · 194 阅读 · 0 评论