码迷,mamicode.com
首页 >  
搜索关键字:lc    ( 989个结果
[LC] 322. Coin Change
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you nee ...
分类:其他好文   时间:2020-01-20 00:24:28    阅读次数:86
[LC] 314. Binary Tree Vertical Order Traversal
Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam ...
分类:其他好文   时间:2020-01-19 00:06:21    阅读次数:82
[LC] 1002. Find Common Characters
Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including d ...
分类:其他好文   时间:2020-01-18 13:04:21    阅读次数:99
[LC] 796. Rotate String
We are given two strings, A and B. A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, ...
分类:其他好文   时间:2020-01-16 12:45:23    阅读次数:79
[LC] 173. Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n ...
分类:其他好文   时间:2020-01-15 23:18:13    阅读次数:92
[LC] 156. Binary Tree Upside Down
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up ...
分类:其他好文   时间:2020-01-15 13:37:21    阅读次数:80
[LC] 250. Count Univalue Subtrees
Given a binary tree, count the number of uni-value subtrees. A Uni-value subtree means all nodes of the subtree have the same value. Example : Input: ...
分类:其他好文   时间:2020-01-14 12:56:57    阅读次数:59
idea Terminal git 提交时 中文乱码
如图,遇到 idea中,git commit 时 中文输入,再删除的时候 就容易乱码 解决办法: 在git安装目录下找到etc/bash.bashrc文件,在文件的最后添加: export LANG="zh_CN.UTF-8" export LC_ALL="zh_CN.UTF-8" 在Termina ...
分类:其他好文   时间:2020-01-13 16:24:13    阅读次数:104
[LC] 117. Populating Next Right Pointers in Each Node II
Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there ...
分类:其他好文   时间:2020-01-13 01:07:44    阅读次数:93
[LC] 443. String Compression
Given an array of characters, compress it in-place. The length after compression must always be smaller than or equal to the original array. Every ele ...
分类:其他好文   时间:2020-01-12 13:42:25    阅读次数:92
989条   上一页 1 ... 13 14 15 16 17 ... 99 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!