lamzc34-优快云博客

原创 Python操作orcale数据库大全

环境准备安装Python、cx_oracle, 解压instantclient-basic-windows.x64-12.2.0.1.0.zip 将解压后instantclient_11_2路径下的oci.dll、oraocci11.dll、oraociei11.dll三个文件复制到python的安装目录下。在解压后instantclient_...

2019-09-24 21:48:41 339

原创 python xlrd读文件错误

workbook = xlrd.open_workbook("A:\excel\1701.xlsx")table1 = workbook.sheet_by_name(u"Sheet1")这样的话总是出错改一下workbook = xlrd.open_workbook("A:\excel/1701.xlsx") 正确了不明......

2019-08-29 09:56:16 1639

这里写自定义目录标题欢迎使用Markdown编辑器新的改变功能快捷键合理的创建标题，有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一个注脚注释也是必不可少的KaTeX数学公式新的甘特图功能，丰富你的文章UML 图表FLowchart流程图导出与导入导出导入欢迎使用Ma...

2019-08-28 15:00:16 2332 2

原创 leetcode Java 204

public int countPrimes(int n) { if(n<=2) return 0; List<Integer> nums = new ArrayList<>(); int result =1; nums.add(2); Boolean isPrimes = true;...

2019-08-07 15:07:40 119

原创 leetcode 203 Java

public ListNode removeElements(ListNode head, int val) { if (head==null) return null; while (head != null && head.val == val) { head = head.next; } if (hea...

2019-08-02 13:49:56 230

原创 leetcode java 202 递归

public boolean isHappy(int n) { if(n==1 || n==7) return true; int m =0; if(n<10) return false; while (n>0) { m+=(n%10)*(n%10); n=n/1...

2019-08-02 12:46:09 116

原创 leetcode 198 动态规划

public int rob(int[] nums) { if (nums==null||nums.length==0) return 0; if (nums.length==1) return nums[0]; if (nums.length==2) return Math.max(nums[0],nums[1]); int...

2019-07-31 12:59:15 170

原创 leetcode java 172

public int trailingZeroes(int n) { if(n==0) return 0; int c=0; while (n/5!=0) { n = n/5; c= c+n; } return c; }...

2019-07-31 10:42:27 191

原创 leetcode Java 171

public int titleToNumber(String s) { int res= 0; for(int i=0; i<s.length();i++) { int temp = s.charAt(i) - 'A' +1; res = res * 26 + temp; } ...

2019-07-30 21:27:42 250

原创 leetcode 169 java

public int majorityElement(int[] nums) { if(nums.length==1) { return nums[0]; } for (int i=0 ;i<nums.length;i++) { int flag=1; ...

2019-07-30 20:27:23 172

原创 leetcode 168 Java

public String convertToTitle(int n) { if(n==0) return null; StringBuilder str = new StringBuilder(); while (n!=0) { n--; str.insert(0,(char)(...

2019-07-30 11:20:02 214

原创 leetcode Java 167

public int[] twoSum(int[] numbers, int target) { int index1; int index2; int[] twosum = new int[2]; for(int i=0;i<numbers.length;i++) { for(in...

2019-07-29 15:32:19 187

原创 leetcode 155 Java

Stack<Integer> stack= new Stack<>(); int min = Integer.MAX_VALUE; public MinStack() { } public void push(int x) { if(x<=min) // 防止空栈出错 { ...

2019-07-28 21:03:50 234

原创 leetcode 141 Java 快慢指针

public boolean hasCycle(ListNode head) { if(head==null) return false; ListNode fast = head; ListNode slow = head; while(1==1){ ...

2019-07-28 14:00:47 120

原创 leetcode Java 136

public int singleNumber(int[] nums) { List<Integer> list = new LinkedList<>(); for( int num:nums) { if(list.contains(num)) { Integer A = new Integ...

2019-07-26 16:57:08 136

原创 leetcode Java 125

public boolean isPalindrome(String s) { Stack stack1 = new Stack<Character>(); Stack stack2 = new Stack<Character>(); s=s.toLowerCase(); char[] charArray =...

2019-07-26 10:55:50 142

原创 leetcode 122 Java

public int maxProfit(int[] prices) { if(prices.length==0||prices.length==1) return 0; int sum=0; int pre=prices[0]; for(int i=1;i<prices.length;i++) { ...

2019-07-24 22:38:47 206

原创 leetcode121 java

public int maxProfit(int[] prices) { int temp=0; if (prices == null || prices.length < 1) { return 0; } for(int i=0;i<prices.length;i++) ...

2019-07-23 17:29:15 221

原创 leetcode 119 Java

public List<Integer> getRow(int rowIndex) { List<Integer> result =new ArrayList<>(); for(int i =0;i<=rowIndex;i++) { result.add(1); ...

2019-07-22 10:17:55 177

原创 leetcode Java 112

public boolean hasPathSum(TreeNode root, int sum) { if(root==null) return false; if (root!=null&&root.right==null&&root.left==null) { if (sum==root...

2019-07-20 12:59:24 81

原创 leetcode 111 Java

public int minDepth(TreeNode root) { if(root==null) { return 0; } if(root.right==null&&root.left==null) { return 1; }...

2019-07-19 12:49:01 200

原创 Java 110 leetcode

public boolean isBalanced(TreeNode root) { if(root==null) return true; int leftH=getHeight(root.left); int rightH=getHeight(root.right); int diff = leftH - rightH; if (diff>1 |...

2019-07-18 19:54:32 345

原创 leetcode107 Java

public List<List<Integer>> levelOrderBottom(TreeNode root) { List<List<Integer>> result =new ArrayList(); List<TreeNode> list=new ArrayList(); if (root==null...

2019-07-18 15:29:27 210

原创 leetcodeJava 104 递归

public int maxDepth(TreeNode root) { if(root==null) { return 0; } return Math.max(maxDepth(root.left),maxDepth(root.right))+1; }...

2019-07-13 23:24:31 172

原创 leetcode101 Java

public static class TreeNode{ int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; }}public boolean isSymmetric(TreeNode root){ if (root==null) { return true; }...

2019-07-12 21:41:16 212

原创 leetcode 100 递归 Java

public static class TreeNode{ int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; }}public boolean isSameTree(TreeNode p, TreeNode q){ if(p==null&&q==null) { ...

2019-07-12 20:24:23 110

原创 leetcode 88 Java 附检测代码

public void merge(int[] nums1, int m, int[] nums2, int n) { int i=m-1; int j=n-1; int temp=m+n-1; while (i>=0&&j>=0) { if (nums1[i]>=nums2[j]) { ...

2019-07-12 00:13:20 244

原创 leetcode83 Java

public ListNode deleteDuplicates(ListNode head) { if(head==null) { return null; } ListNode cur = head; while (cur.next!=null) { if(...

2019-07-11 20:26:37 349

原创 leetcode70 Java 斐波拉契应用

public int climbStairs(int n) { int result1 =0; int result2 =0; if(n==1) { result2 =1; } for (int i=1 ; i<=n ;i++) { ...

2019-07-11 00:33:14 132

原创 leetcode69 java 二分法应用

public int mySqrt(int x) { int high = x; int low = 1; int mid = (high+low)/2; while (low<=high) { if (mid == x/ mid) { return...

2019-07-11 00:03:45 264

原创 leetcode 67java

public String addBinary(String a, String b) { String result = ""; int aLen = a.length() - 1; int bLen = b.length() - 1; int sum = 0; while(aLen>=0 || bLen...

2019-07-09 20:43:47 198

原创 leetcode66 java

public int[] plusOne(int[] digits) { int len = digits.length; for(int i=len-1;i>=0;i--) { if(digits[i]!=9) { digits[i]+=1; r...

2019-07-09 18:56:36 116

原创 leetcode 58 java

public int lengthOfLastWord(String s) { if(s.length()==0){ return 0; } //使用trim方法将字符串左右空格去掉 String str=s.trim(); int len=str.length(); //最后单...

2019-07-08 11:55:14 237

原创 leetcode35 java

class Solution { public int searchInsert(int[] nums, int target) { int temp = 0; if (nums==null) { return 0; } else { for(int i=0;i&l...

2019-07-08 00:33:47 200

原创 leetcode 28java

public int strStr(String haystack, String needle){ if(needle.length()==0) return 0; for(int i =0;i< haystack.length();i++) { int m = 0; for(int j=0;j<needle....

2019-07-07 14:24:33 197

原创 leetcode27 java

public static int removeElement(int[] nums, int val) { int result = 0; int index = 0; while(index < nums.length) { if(nums[index] != val) { nums[result]...

2019-07-07 11:00:36 210

原创 leetcode26 java

public static int removeDuplicates(int[] nums) { int result =1; for (int i=1;i<nums.length;i++) { if (nums[i]!=nums[i-1]) { result+...

2019-07-06 21:56:14 281

原创 leetcode21 java 有序链表合一（虚表头与递归）

public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1==null&&l2==null) { return null; } ListNode head = new ListNode(0); Lis...

2019-07-06 20:17:11 103

原创 leetcode20 java 栈的应用（push and pop）

public boolean isValid(String s) { if(s.equals("")||s == null) { return true; } if(s.length()%2!=0) // 避免类似[])的情况 { return false; } char[] Char = s.toCharArray(); /...

2019-07-05 10:59:38 313

原创 leetcode14 Java

public String longestCommonPrefix(String[] strs) { //String temp= strs[0] ; //让第一个与后面一一比较这是思路 if(strs.length==0 || strs.equals("")) // 判断第一个元素的情况 { return ""; ...

2019-07-04 16:07:34 276

空空如也

空空如也