12. Integer to Roman 题目 Given an integer, convert it to a roman numeral. Input is guaranteed to be within the …
分类:LeetCode题目解答
[LeetCode] Redundant Connection II 冗余的连接之二
In this problem, a rooted tree is a directed graph such that, there is exactly one node (the …
[Leetcode] Add Binary 二进制相加
Add Binary Given two binary strings, return their sum (also a binary string). For example, a = “11”…
127. Word Ladder
欢迎fork and star:Nowcoder-Repository-github 127. Word Ladder 题目 Given two words (beginWord and endWord), and a …
[LeetCode] Is Graph Bipartite? 是二分图么?
Given an undirected graph, return true if and only if it is bipartite. Recall that a gra…
[LeetCode] Inorder Successor in BST 二叉搜索树中的中序后继节点
Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note:…
[LeetCode] Partition to K Equal Sum Subsets 分割K个等和的子集
Given an array of integers nums and a positive integer k, find whether it’s possib…
[Leetcode] Compare Version Numbers 比较版本号
Compare Version Numbers Compare two version numbers version1 and version2. If version1 > version2 return 1,…
[CS101] Programming Languages and OOP 编程语言及面向对象基础题
编程语言及面向对象基础题 Design Pattern What is singleton? What’s its cons and pros? How to implement it?Definition:…
60 Permutation Sequence
60 Permutation Sequence 题目 The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labe…
240. Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following prope…
[Leetcode] Count Complete Tree Nodes 统计完全树节点数
Count Complete Tree Nodes Given a complete binary tree, count the number of nodes. Definition of a complete bi…