上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 15 下一页
摘要: 将spark maven更新至1.6,运行原有程序,发现以下错误: java.lang.IllegalArgumentException: System memory 259522560 must be at least 4.718592E8. Please use a larger heap si 阅读全文
posted @ 2016-03-10 00:37 ZHOU YANG 阅读(2434) 评论(0) 推荐(0)
摘要: 介绍: 两个activity进行跳转,在跳转过程中,将message由MainActivity传递到secondActivity,并且当secondActivity退回至MainActivity时,也传递消息给MainActivity。 首先是MainActivity的布局文件: activity_ 阅读全文
posted @ 2016-03-09 20:00 ZHOU YANG 阅读(15234) 评论(0) 推荐(0)
摘要: Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be for 阅读全文
posted @ 2016-03-09 13:09 ZHOU YANG 阅读(312) 评论(0) 推荐(0)
摘要: 首先是布局文件,如下: activity_main.xml <?xml version="1.0" encoding="utf-8"?> <LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" android: 阅读全文
posted @ 2016-03-09 11:55 ZHOU YANG 阅读(424) 评论(0) 推荐(0)
摘要: You are given an integer array nums and you have to return a new counts array. Thecounts array has the property where counts[i] is the number of small 阅读全文
posted @ 2016-03-08 22:48 ZHOU YANG 阅读(211) 评论(0) 推荐(0)
摘要: Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or do 阅读全文
posted @ 2016-03-08 20:20 ZHOU YANG 阅读(190) 评论(0) 推荐(0)
摘要: 花了整整一个下午,终于在新浪sae部署完成WeRoBot,现在将其中的曲折记录下来。 首先下载WeRoBot-SAE-demo,按照README.md中的要求,执行下述命令: 然后编辑config.yaml文件,更改其中的name 接着打包该路径下的所有文件: 进入新浪sae的代码管理界面,将刚才打 阅读全文
posted @ 2016-03-08 16:46 ZHOU YANG 阅读(940) 评论(2) 推荐(0)
摘要: 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 阅读全文
posted @ 2016-03-06 16:42 ZHOU YANG 阅读(199) 评论(0) 推荐(0)
摘要: Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum 阅读全文
posted @ 2016-03-06 16:21 ZHOU YANG 阅读(229) 评论(0) 推荐(0)
摘要: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2016-03-06 16:19 ZHOU YANG 阅读(343) 评论(0) 推荐(0)
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 15 下一页