Skip to content

Instantly share code, notes, and snippets.

<?xml version="1.0" encoding="utf-8"?>
<set xmlns:android="http://schemas.android.com/apk/res/android"
android:shareInterpolator="true" android:ordering="sequentially">
<rotate
android:fromDegrees="0"
android:toDegrees="30"
android:duration="500"
android:pivotX="50%"
android:pivotY="50%">
</rotate>
final ImageView image = (ImageView) findViewById(R.id.imageview_to_animate);
Animation rotate = AnimationUtils.loadAnimation(getApplicationContext(), R.anim.rotate_picture);
image.startAnimation(rotate);
#! /bin/bash
IFS="
"
echo
for FRAME in \
" B :^)" \
" B :^)" \
" B :^)" \
" B :^)" \
@phyous
phyous / gist:7983685
Created December 16, 2013 07:56
The world's simplest twitter client
#!/usr/bin/env ruby
########################
# The world's simplest twitter client
# 1- Get an API key form https://dev.twitter.com with read/write access, enter details below @'ENTER_HERE'
# 2- gem install twitter
# 3- ./post
# 4- Start posting
########################
require "rubygems"
def pascalsTriangle(n)
return [] if n < 0
return [1] if n == 0
ret = Array.new(n, []).map.each_with_index {|a, i| a = Array.new(i+1,1)}
(1..n-1).each do |y|
(0..y).each do |x|
idy1 = y - 1
idx1 = x - 1
@phyous
phyous / CalculateWater.java
Last active August 29, 2015 14:00
CalculateWater
/**
* Trapping Water
*
* A one-dimensional container is specified by an array of
* n nonnegative integers, specifying the eight of each
* unit-width rectangle. Design an algorithm for computing
* the capacity of the container.
*
* Ex: (X = Occupied, ▤ = Water)
*
public static boolean oneEditAppart(String a, String b) {
int edits = 0;
if (a == null || b == null || Math.abs(a.length() - b.length()) > 1) { // Strings more than 1 in size difference
return false;
} else if (a.length() == b.length()) { // Strings same size, check for 0 or >1 replacements
for (int i = 0; i < a.length(); i++) {
if (a.charAt(i) != b.charAt(i)) {
if (++edits > 1) return false;
}
}
@phyous
phyous / Trie.java
Created June 7, 2014 19:22
Having fun with Tries
package com.other.rand;
import java.util.ArrayList;
import java.util.List;
/*
Let's create a trie data structure and run some tests on it
Documentation:
- http://en.wikipedia.org/wiki/TrieTest
- http://www.geeksforgeeks.org/trie-insert-and-search/
import android.app.Activity;
import android.os.Bundle;
import android.util.Log;
import android.view.Menu;
import android.view.MenuItem;
public class MyActivity extends Activity {
@Override
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
android:orientation="vertical"
android:layout_width="match_parent"
android:layout_height="match_parent"
android:background="@color/orange_hn"
>
<TextView