java
frankstar123
这个作者很懒,什么都没留下…
展开
-
java操作excel
jxl是一个韩国人写的java操作excel的工具, 在开源世界中,有两套比较有影响的API可供使用,一个是POI,一个是jExcelAPI。其中功能相对POI比较弱一点。但jExcelAPI对中文支持非常好,API是纯Java的, 并不依赖Windows系统,即使运行在Linux下,它同样能够正确的处理Excel文件。 另外需要说明的是,这套API对图形和图表的支持很有限,而且仅仅识别PNG格式转载 2014-11-10 16:19:46 · 300 阅读 · 0 评论 -
leetcode 237. Delete Node in a Linked List
题目内容 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with val原创 2016-03-14 16:49:15 · 320 阅读 · 0 评论 -
leetcode 242. Valid Anagram
题目内容 Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume原创 2016-03-14 17:14:06 · 197 阅读 · 0 评论 -
leetcode 70. Climbing Stairs
题目内容 You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 题目分析 我们假设,最后一步完成爬台阶。那么就有两种爬法出原创 2016-03-14 21:11:48 · 248 阅读 · 0 评论 -
leetcode 83. Remove Duplicates from Sorted List
题目内容 Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 题目分析 删除已排序链表中重复出现的结点,所有原创 2016-03-14 21:33:42 · 211 阅读 · 0 评论 -
leetcode 328. Odd Even Linked List
题目内容 Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it i原创 2016-03-14 23:22:18 · 224 阅读 · 0 评论 -
leetcode 217. Contains Duplicate
题目内容 Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every eleme原创 2016-03-15 09:57:53 · 321 阅读 · 0 评论 -
leetcode 171. Excel Sheet Column Number
题目内容 Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1B -> 2C -> 3...Z -> 26AA -> 27AB -> 28原创 2016-03-15 10:09:36 · 232 阅读 · 0 评论 -
leetcode 100. Same Tree
题目内容 Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 题目分析 递归调用函原创 2016-03-15 10:25:11 · 365 阅读 · 0 评论 -
leetcode 141. Linked List Cycle
题目内容 Given a linked list, determine if it has a cycle in it. 题目分析 判断一个链表是否有环, 设置fast和slow两个flag,当fast和slow相遇以后就证明有环 具体证明 点击这里/** * Definition for singly-linked list. * class ListNode { *原创 2016-05-10 16:47:19 · 254 阅读 · 0 评论 -
LeetCode 142. Linked List Cycle II
题目内容 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. 题目分析 在141题的基础上,加入了寻找出了环的起点位置,如果有环找出起点,没有环返回null。 找出环的起点,当找到确定有环以后,讲fast标记回head结点,然后步长调整为1,当再次与原创 2016-05-10 17:49:16 · 237 阅读 · 0 评论 -
leetcode 226. Invert Binary Tree
题目描述 Invert a binary tree. 题目分析 将二叉树翻转,通过不断递归实现二叉树的翻转。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNo原创 2016-03-14 16:35:35 · 271 阅读 · 0 评论 -
leetcode 232. Implement Queue using Stacks
题目内容 Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.e原创 2016-03-14 16:21:17 · 317 阅读 · 0 评论 -
leetcode 263. Ugly Number
题目内容 Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly sinc原创 2016-03-14 15:43:01 · 259 阅读 · 0 评论 -
java 报错 the type JOptionPane is not accessible due to restriction on required library ×
报错描述Description Resource Path Location Type Access restriction: The method showInputDialog(Component, Object) from the type JOptionPane is not accessible due to restriction on required library原创 2015-12-30 17:25:17 · 2215 阅读 · 0 评论 -
Type mismatch: cannot convert from Integer to int(java 报错)
Type mismatch: cannot convert from Integer to int报这个错的原因是 在给Integer赋值的时候,与int类型不匹配造成的, int i = 0; Integer wrapperi = i; 出现该错误,原因是jdk版本不对。JDK1.5以后,Java为我们提供了更为丰富的转换方法。其中最值得一提的就是自动装包/自动拆包(AutoB原创 2015-12-22 16:19:23 · 31577 阅读 · 2 评论 -
leetcode 101. Symmetric Tree
题目内容 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following原创 2016-03-16 21:47:57 · 314 阅读 · 0 评论 -
leetcode 292. Nim Game 题解
题目You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be th原创 2016-03-09 11:34:24 · 414 阅读 · 0 评论 -
leetcode 136. Single Number 题解
题目:Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usin原创 2016-03-09 11:55:35 · 391 阅读 · 1 评论 -
leetcode 169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element always原创 2016-03-11 21:44:11 · 260 阅读 · 0 评论 -
leetcode 104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.题目解析 求一个二叉树的树的深度。 有两种求法,深度优先(DFS)和广度优先(BF原创 2016-03-12 20:40:05 · 241 阅读 · 0 评论 -
求二叉树的宽度
题目描述 给出一棵二叉树,求二叉树的宽度。 解析 二叉树的宽度:空的二叉树的宽度为0,非空二叉树的宽度为各层结点个数的最大值。 依然用BFS。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode rig原创 2016-03-14 09:31:52 · 568 阅读 · 0 评论 -
leetcode 206. Reverse Linked List
题目内容 Reverse a singly linked list.题目分析 对单链表进行反转 单链表翻转的时候,搞懂结点的赋值与更新就OK了,这块有点儿绕。/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListN原创 2016-03-14 11:33:47 · 244 阅读 · 0 评论 -
leetcode 283. Move Zeroes
题目内容 Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you原创 2016-03-14 11:48:17 · 226 阅读 · 0 评论 -
java 容器总结
java提供了一套完整的容器类:List,Set,Queue,Map。 按照用途的不同将其划分为两个概念,Collection 和 MapCollection :一个独立元素的序列,这些元素服从一条或者多条规则。List 必须按照插入顺序保存元素;Set 不能有重复元素;Queue 按照排队规则来确定对象产生的顺序。map:一组成对的“键值对”对象,允许使用键来查找值。这种映射关系使得我们能够原创 2016-05-23 10:32:06 · 280 阅读 · 0 评论